/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_LAZY.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:57:29,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:57:29,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:57:29,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:57:29,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:57:29,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:57:29,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:57:29,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:57:29,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:57:29,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:57:29,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:57:29,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:57:29,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:57:29,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:57:29,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:57:29,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:57:29,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:57:29,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:57:29,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:57:29,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:57:29,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:57:29,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:57:29,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:57:29,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:57:29,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:57:29,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:57:29,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:57:29,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:57:29,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:57:29,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:57:29,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:57:29,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:57:29,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:57:29,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:57:29,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:57:29,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:57:29,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:57:29,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:57:29,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:57:29,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:57:29,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:57:29,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:57:29,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:57:29,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:57:29,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:57:29,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:57:29,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:57:29,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:57:29,543 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:57:29,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:57:29,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:57:29,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:57:29,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:57:29,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:57:29,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:57:29,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:57:29,547 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:57:29,547 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 15:57:29,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:57:29,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:57:29,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:57:29,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:57:29,753 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:57:29,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2022-01-10 15:57:29,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ce0d7e0/4c2dc57f282e414a96c77609d6f3f354/FLAGa51cca426 [2022-01-10 15:57:30,229 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:57:30,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2022-01-10 15:57:30,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ce0d7e0/4c2dc57f282e414a96c77609d6f3f354/FLAGa51cca426 [2022-01-10 15:57:30,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ce0d7e0/4c2dc57f282e414a96c77609d6f3f354 [2022-01-10 15:57:30,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:57:30,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:57:30,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:57:30,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:57:30,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:57:30,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee5bc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30, skipping insertion in model container [2022-01-10 15:57:30,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:57:30,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:57:30,553 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_label13.c[20841,20854] [2022-01-10 15:57:30,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:57:30,573 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:57:30,648 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_label13.c[20841,20854] [2022-01-10 15:57:30,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:57:30,661 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:57:30,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30 WrapperNode [2022-01-10 15:57:30,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:57:30,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:57:30,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:57:30,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:57:30,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,733 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-10 15:57:30,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:57:30,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:57:30,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:57:30,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:57:30,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:57:30,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:57:30,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:57:30,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:57:30,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (1/1) ... [2022-01-10 15:57:30,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:57:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:57:30,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 15:57:30,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 15:57:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:57:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:57:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:57:30,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:57:30,898 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:57:30,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:57:31,622 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:57:31,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:57:31,632 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:57:31,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:57:31 BoogieIcfgContainer [2022-01-10 15:57:31,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:57:31,635 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:57:31,635 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:57:31,636 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:57:31,638 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:57:31" (1/1) ... [2022-01-10 15:57:31,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:57:31 BasicIcfg [2022-01-10 15:57:31,864 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:57:31,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:57:31,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:57:31,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:57:31,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:57:30" (1/4) ... [2022-01-10 15:57:31,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8da757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:57:31, skipping insertion in model container [2022-01-10 15:57:31,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:57:30" (2/4) ... [2022-01-10 15:57:31,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8da757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:57:31, skipping insertion in model container [2022-01-10 15:57:31,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:57:31" (3/4) ... [2022-01-10 15:57:31,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8da757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:57:31, skipping insertion in model container [2022-01-10 15:57:31,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:57:31" (4/4) ... [2022-01-10 15:57:31,869 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label13.cTransformedIcfg [2022-01-10 15:57:31,875 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:57:31,875 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:57:31,917 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:57:31,925 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 15:57:31,925 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:57:31,940 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-10 15:57:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 15:57:31,952 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:31,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:31,953 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash 874788480, now seen corresponding path program 1 times [2022-01-10 15:57:31,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:31,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145262943] [2022-01-10 15:57:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:31,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:32,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:32,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145262943] [2022-01-10 15:57:32,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145262943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:32,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:32,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:57:32,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183008718] [2022-01-10 15:57:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:32,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:32,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:32,366 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 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:33,035 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-10 15:57:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-01-10 15:57:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:33,045 INFO L225 Difference]: With dead ends: 528 [2022-01-10 15:57:33,045 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 15:57:33,047 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-10 15:57:33,053 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:33,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 15:57:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 15:57:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-10 15:57:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions. [2022-01-10 15:57:33,105 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 123 [2022-01-10 15:57:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:33,105 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 392 transitions. [2022-01-10 15:57:33,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions. [2022-01-10 15:57:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 15:57:33,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:33,107 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:57:33,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1443224466, now seen corresponding path program 1 times [2022-01-10 15:57:33,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846743990] [2022-01-10 15:57:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:33,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:33,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:33,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846743990] [2022-01-10 15:57:33,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846743990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:33,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:33,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:57:33,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712116386] [2022-01-10 15:57:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:33,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:33,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:33,209 INFO L87 Difference]: Start difference. First operand 266 states and 392 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:33,611 INFO L93 Difference]: Finished difference Result 792 states and 1171 transitions. [2022-01-10 15:57:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:33,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-01-10 15:57:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:33,614 INFO L225 Difference]: With dead ends: 792 [2022-01-10 15:57:33,614 INFO L226 Difference]: Without dead ends: 528 [2022-01-10 15:57:33,615 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-10 15:57:33,616 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:33,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:57:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-10 15:57:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-10 15:57:33,628 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-10 15:57:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2022-01-10 15:57:33,629 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 128 [2022-01-10 15:57:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:33,629 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2022-01-10 15:57:33,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2022-01-10 15:57:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-10 15:57:33,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:33,632 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:33,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:57:33,632 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1082822148, now seen corresponding path program 1 times [2022-01-10 15:57:33,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:33,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888554793] [2022-01-10 15:57:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:33,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:33,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888554793] [2022-01-10 15:57:33,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888554793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:33,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:33,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:57:33,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090365736] [2022-01-10 15:57:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:33,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:33,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:33,713 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:34,160 INFO L93 Difference]: Finished difference Result 1447 states and 2032 transitions. [2022-01-10 15:57:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:34,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-01-10 15:57:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:34,163 INFO L225 Difference]: With dead ends: 1447 [2022-01-10 15:57:34,163 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 15:57:34,165 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-10 15:57:34,166 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:34,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 55 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:57:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 15:57:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-01-10 15:57:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2902173913043478) internal successors, (1187), 920 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1187 transitions. [2022-01-10 15:57:34,184 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1187 transitions. Word has length 138 [2022-01-10 15:57:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:34,185 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1187 transitions. [2022-01-10 15:57:34,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1187 transitions. [2022-01-10 15:57:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-10 15:57:34,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:34,187 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:34,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:57:34,187 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -332212006, now seen corresponding path program 1 times [2022-01-10 15:57:34,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11320089] [2022-01-10 15:57:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:34,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 15:57:34,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:34,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11320089] [2022-01-10 15:57:34,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11320089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:34,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:34,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:57:34,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945508410] [2022-01-10 15:57:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:34,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:34,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:34,284 INFO L87 Difference]: Start difference. First operand 921 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:34,674 INFO L93 Difference]: Finished difference Result 2102 states and 2725 transitions. [2022-01-10 15:57:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 139 [2022-01-10 15:57:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:34,677 INFO L225 Difference]: With dead ends: 2102 [2022-01-10 15:57:34,677 INFO L226 Difference]: Without dead ends: 1183 [2022-01-10 15:57:34,678 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-10 15:57:34,679 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:34,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 60 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:57:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-01-10 15:57:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2022-01-10 15:57:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.252115059221658) internal successors, (1480), 1182 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1480 transitions. [2022-01-10 15:57:34,694 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1480 transitions. Word has length 139 [2022-01-10 15:57:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:34,694 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1480 transitions. [2022-01-10 15:57:34,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1480 transitions. [2022-01-10 15:57:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 15:57:34,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:34,696 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:34,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:57:34,696 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash -783459359, now seen corresponding path program 1 times [2022-01-10 15:57:34,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:34,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424577547] [2022-01-10 15:57:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:34,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:34,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:34,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424577547] [2022-01-10 15:57:34,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424577547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:34,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:34,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:57:34,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072028350] [2022-01-10 15:57:34,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:34,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:57:34,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:57:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:57:34,759 INFO L87 Difference]: Start difference. First operand 1183 states and 1480 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:35,337 INFO L93 Difference]: Finished difference Result 2888 states and 3590 transitions. [2022-01-10 15:57:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:57:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2022-01-10 15:57:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:35,341 INFO L225 Difference]: With dead ends: 2888 [2022-01-10 15:57:35,341 INFO L226 Difference]: Without dead ends: 1707 [2022-01-10 15:57:35,342 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-10 15:57:35,343 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 267 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:35,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 58 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:57:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-10 15:57:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-01-10 15:57:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.231111111111111) internal successors, (1939), 1575 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1939 transitions. [2022-01-10 15:57:35,362 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1939 transitions. Word has length 142 [2022-01-10 15:57:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:35,362 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1939 transitions. [2022-01-10 15:57:35,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1939 transitions. [2022-01-10 15:57:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 15:57:35,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:35,364 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2022-01-10 15:57:35,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:57:35,365 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1457714766, now seen corresponding path program 1 times [2022-01-10 15:57:35,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:35,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199860693] [2022-01-10 15:57:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:35,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:35,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:35,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199860693] [2022-01-10 15:57:35,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199860693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:35,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:35,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:57:35,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946736028] [2022-01-10 15:57:35,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:35,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:35,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:35,477 INFO L87 Difference]: Start difference. First operand 1576 states and 1939 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:35,869 INFO L93 Difference]: Finished difference Result 3150 states and 3876 transitions. [2022-01-10 15:57:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-10 15:57:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:35,874 INFO L225 Difference]: With dead ends: 3150 [2022-01-10 15:57:35,874 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 15:57:35,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:35,876 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:35,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 175 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:57:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 15:57:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2022-01-10 15:57:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.166031987814166) internal successors, (1531), 1313 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1531 transitions. [2022-01-10 15:57:35,891 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1531 transitions. Word has length 160 [2022-01-10 15:57:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:35,891 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1531 transitions. [2022-01-10 15:57:35,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1531 transitions. [2022-01-10 15:57:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 15:57:35,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:35,893 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:35,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:57:35,894 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:35,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1816867639, now seen corresponding path program 1 times [2022-01-10 15:57:35,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:35,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959369078] [2022-01-10 15:57:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:35,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 15:57:35,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:35,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959369078] [2022-01-10 15:57:35,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959369078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:35,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:35,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:57:35,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252195196] [2022-01-10 15:57:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:35,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:57:35,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:57:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:57:35,995 INFO L87 Difference]: Start difference. First operand 1314 states and 1531 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:36,585 INFO L93 Difference]: Finished difference Result 3019 states and 3555 transitions. [2022-01-10 15:57:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:57:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 197 [2022-01-10 15:57:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:36,589 INFO L225 Difference]: With dead ends: 3019 [2022-01-10 15:57:36,590 INFO L226 Difference]: Without dead ends: 1707 [2022-01-10 15:57:36,591 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-10 15:57:36,591 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 227 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:36,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 58 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 15:57:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-10 15:57:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2022-01-10 15:57:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.145369284876905) internal successors, (1954), 1706 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1954 transitions. [2022-01-10 15:57:36,611 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1954 transitions. Word has length 197 [2022-01-10 15:57:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:36,611 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1954 transitions. [2022-01-10 15:57:36,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1954 transitions. [2022-01-10 15:57:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-10 15:57:36,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:36,614 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 1, 1, 1, 1] [2022-01-10 15:57:36,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:57:36,614 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2114524951, now seen corresponding path program 1 times [2022-01-10 15:57:36,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:36,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626133450] [2022-01-10 15:57:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:36,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 15:57:36,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:36,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626133450] [2022-01-10 15:57:36,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626133450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:36,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:36,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:57:36,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817926755] [2022-01-10 15:57:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:36,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:57:36,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:57:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:57:36,705 INFO L87 Difference]: Start difference. First operand 1707 states and 1954 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:37,286 INFO L93 Difference]: Finished difference Result 3543 states and 4067 transitions. [2022-01-10 15:57:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:57:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 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 210 [2022-01-10 15:57:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:37,291 INFO L225 Difference]: With dead ends: 3543 [2022-01-10 15:57:37,291 INFO L226 Difference]: Without dead ends: 1838 [2022-01-10 15:57:37,293 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-10 15:57:37,293 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 228 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:37,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 33 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 15:57:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-10 15:57:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-01-10 15:57:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.125204137180185) internal successors, (2067), 1837 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2067 transitions. [2022-01-10 15:57:37,322 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2067 transitions. Word has length 210 [2022-01-10 15:57:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:37,323 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2067 transitions. [2022-01-10 15:57:37,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2067 transitions. [2022-01-10 15:57:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-01-10 15:57:37,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:37,327 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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] [2022-01-10 15:57:37,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:57:37,327 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -111565503, now seen corresponding path program 1 times [2022-01-10 15:57:37,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005493519] [2022-01-10 15:57:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:37,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 15:57:37,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005493519] [2022-01-10 15:57:37,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005493519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:37,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:37,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:57:37,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392612464] [2022-01-10 15:57:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:37,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:57:37,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:57:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:57:37,445 INFO L87 Difference]: Start difference. First operand 1838 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:37,802 INFO L93 Difference]: Finished difference Result 3674 states and 4132 transitions. [2022-01-10 15:57:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:57:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 219 [2022-01-10 15:57:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:37,807 INFO L225 Difference]: With dead ends: 3674 [2022-01-10 15:57:37,807 INFO L226 Difference]: Without dead ends: 1838 [2022-01-10 15:57:37,809 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-10 15:57:37,811 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 83 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:37,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 61 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 15:57:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-10 15:57:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-01-10 15:57:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1219379422972238) internal successors, (2061), 1837 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2061 transitions. [2022-01-10 15:57:37,835 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2061 transitions. Word has length 219 [2022-01-10 15:57:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:37,835 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2061 transitions. [2022-01-10 15:57:37,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2061 transitions. [2022-01-10 15:57:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-01-10 15:57:37,838 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:57:37,838 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2022-01-10 15:57:37,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:57:37,838 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:57:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:57:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1971910708, now seen corresponding path program 1 times [2022-01-10 15:57:37,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:57:37,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574016927] [2022-01-10 15:57:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:57:37,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:57:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:57:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:57:38,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:57:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574016927] [2022-01-10 15:57:38,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574016927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:57:38,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:57:38,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 15:57:38,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110366853] [2022-01-10 15:57:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:57:38,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:57:38,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:57:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:57:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:57:38,058 INFO L87 Difference]: Start difference. First operand 1838 states and 2061 transitions. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:57:39,058 INFO L93 Difference]: Finished difference Result 4589 states and 5126 transitions. [2022-01-10 15:57:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 15:57:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-01-10 15:57:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:57:39,060 INFO L225 Difference]: With dead ends: 4589 [2022-01-10 15:57:39,061 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:57:39,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-10 15:57:39,064 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1016 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 15:57:39,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 27 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 15:57:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:57:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:57:39,066 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-10 15:57:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:57:39,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2022-01-10 15:57:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:57:39,066 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:57:39,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:57:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:57:39,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:57:39,068 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:57:39,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:57:39,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:57:39,401 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a20~0Int 1)) (.cse5 (<= ~a16~0Int 5)) (.cse2 (= ~a17~0Int 1)) (.cse0 (= ~a21~0Int 1)) (.cse1 (not (= ~a7~0Int 1))) (.cse3 (= ~a12~0Int 8)) (.cse4 (not (= ~a8~0Int 14))) (.cse6 (= ~a17~0Int 0))) (or (and (= ~a20~0Int 0) (= ~a16~0Int 6) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse7 .cse4 .cse6) (and .cse5 .cse2 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse6))) [2022-01-10 15:57:39,401 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-10 15:57:39,401 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a20~0Int 1)) (.cse5 (<= ~a16~0Int 5)) (.cse2 (= ~a17~0Int 1)) (.cse0 (= ~a21~0Int 1)) (.cse1 (not (= ~a7~0Int 1))) (.cse3 (= ~a12~0Int 8)) (.cse4 (not (= ~a8~0Int 14))) (.cse6 (= ~a17~0Int 0))) (or (and (= ~a20~0Int 0) (= ~a16~0Int 6) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse7 .cse4 .cse6) (and .cse5 .cse2 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse6))) [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-10 15:57:39,402 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-10 15:57:39,403 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-10 15:57:39,404 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-10 15:57:39,405 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 15:57:39,406 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-10 15:57:39,407 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-10 15:57:39,408 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,409 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,410 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,411 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-10 15:57:39,415 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,415 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-10 15:57:39,415 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,415 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-10 15:57:39,416 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,416 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-10 15:57:39,416 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 555) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-10 15:57:39,417 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-10 15:57:39,418 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-10 15:57:39,421 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:57:39,423 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:57:39,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:57:39 BasicIcfg [2022-01-10 15:57:39,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:57:39,454 INFO L158 Benchmark]: Toolchain (without parser) took 9192.57ms. Allocated memory was 170.9MB in the beginning and 297.8MB in the end (delta: 126.9MB). Free memory was 119.6MB in the beginning and 235.0MB in the end (delta: -115.4MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,454 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 170.9MB. Free memory was 137.8MB in the beginning and 137.7MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:57:39,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.20ms. Allocated memory is still 170.9MB. Free memory was 119.4MB in the beginning and 124.2MB in the end (delta: -4.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.87ms. Allocated memory is still 170.9MB. Free memory was 124.2MB in the beginning and 118.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,455 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 170.9MB. Free memory was 118.4MB in the beginning and 114.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,455 INFO L158 Benchmark]: RCFGBuilder took 865.26ms. Allocated memory is still 170.9MB. Free memory was 114.2MB in the beginning and 54.5MB in the end (delta: 59.8MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,455 INFO L158 Benchmark]: IcfgTransformer took 228.75ms. Allocated memory was 170.9MB in the beginning and 219.2MB in the end (delta: 48.2MB). Free memory was 54.5MB in the beginning and 158.5MB in the end (delta: -104.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,455 INFO L158 Benchmark]: TraceAbstraction took 7587.46ms. Allocated memory was 219.2MB in the beginning and 297.8MB in the end (delta: 78.6MB). Free memory was 157.9MB in the beginning and 235.0MB in the end (delta: -77.0MB). Peak memory consumption was 148.9MB. Max. memory is 8.0GB. [2022-01-10 15:57:39,457 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.09ms. Allocated memory is still 170.9MB. Free memory was 137.8MB in the beginning and 137.7MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 399.20ms. Allocated memory is still 170.9MB. Free memory was 119.4MB in the beginning and 124.2MB in the end (delta: -4.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.87ms. Allocated memory is still 170.9MB. Free memory was 124.2MB in the beginning and 118.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 170.9MB. Free memory was 118.4MB in the beginning and 114.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 865.26ms. Allocated memory is still 170.9MB. Free memory was 114.2MB in the beginning and 54.5MB in the end (delta: 59.8MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. * IcfgTransformer took 228.75ms. Allocated memory was 170.9MB in the beginning and 219.2MB in the end (delta: 48.2MB). Free memory was 54.5MB in the beginning and 158.5MB in the end (delta: -104.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7587.46ms. Allocated memory was 219.2MB in the beginning and 297.8MB in the end (delta: 78.6MB). Free memory was 157.9MB in the beginning and 235.0MB in the end (delta: -77.0MB). Peak memory consumption was 148.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: 555]: 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2335 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2335 mSDsluCounter, 600 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 1043 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4727 IncrementalHoareTripleChecker+Invalid, 5770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1043 mSolverCounterUnsat, 526 mSDtfsCounter, 4727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 393 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 312 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1046 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1685 NumberOfCodeBlocks, 1685 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 7639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 648/648 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) && !(a7 == 1bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17) && 1bv32 == a21) || (((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && !(14bv32 == a8)) && 1bv32 == a17) && 1bv32 == a21)) || ((1bv32 == a20 && !(14bv32 == a8)) && 0bv32 == a17)) || ((((((8bv32 == a12 && !(a7 == 1bv32)) && 6bv32 == a16) && 0bv32 == a20) && !(14bv32 == a8)) && 1bv32 == a17) && 1bv32 == a21)) || (((8bv32 == a12 && 0bv32 == a17) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && !(14bv32 == a8)) && 0bv32 == a17) && 1bv32 == a21)) || ((!(14bv32 == a8) && ~bvule32(a16, 5bv32)) && 1bv32 == a17) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17) && 1bv32 == a21) || (((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && !(14bv32 == a8)) && 1bv32 == a17) && 1bv32 == a21)) || ((1bv32 == a20 && !(14bv32 == a8)) && 0bv32 == a17)) || ((((((8bv32 == a12 && !(a7 == 1bv32)) && 6bv32 == a16) && 0bv32 == a20) && !(14bv32 == a8)) && 1bv32 == a17) && 1bv32 == a21)) || (((8bv32 == a12 && 0bv32 == a17) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && !(14bv32 == a8)) && 0bv32 == a17) && 1bv32 == a21)) || ((!(14bv32 == a8) && ~bvule32(a16, 5bv32)) && 1bv32 == a17) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:57:39,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...