/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:35:36,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:35:36,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:35:36,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:35:36,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:35:36,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:35:36,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:35:36,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:35:36,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:35:36,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:35:36,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:35:36,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:35:36,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:35:36,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:35:36,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:35:36,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:35:36,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:35:36,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:35:36,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:35:36,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:35:36,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:35:36,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:35:36,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:35:36,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:35:36,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:35:36,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:35:36,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:35:36,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:35:36,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:35:36,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:35:36,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:35:36,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:35:36,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:35:36,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:35:36,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:35:36,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:35:36,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:35:36,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:35:36,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:35:36,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:35:36,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:35:36,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:35:36,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:35:36,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:35:36,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:35:36,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:35:36,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:35:36,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:35:36,478 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:35:36,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:35:36,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:35:36,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:35:36,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:35:36,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:35:36,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:35:36,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:35:36,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:35:36,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:35:36,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:36,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:35:36,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:35:36,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:35:36,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:35:36,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:35:36,484 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:35:36,484 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:35:36,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:35:36,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:35:36,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:35:36,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:35:36,717 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:35:36,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2022-01-11 03:35:36,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f44224a/844d7053fefa47238723c3a2fcc133a5/FLAGa08700578 [2022-01-11 03:35:37,180 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:35:37,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2022-01-11 03:35:37,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f44224a/844d7053fefa47238723c3a2fcc133a5/FLAGa08700578 [2022-01-11 03:35:37,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f44224a/844d7053fefa47238723c3a2fcc133a5 [2022-01-11 03:35:37,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:35:37,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:35:37,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:37,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:35:37,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:35:37,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:37" (1/1) ... [2022-01-11 03:35:37,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415da29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:37, skipping insertion in model container [2022-01-11 03:35:37,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:37" (1/1) ... [2022-01-11 03:35:37,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:35:37,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:35:37,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30.c[21088,21101] [2022-01-11 03:35:37,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:37,922 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:35:38,026 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_label30.c[21088,21101] [2022-01-11 03:35:38,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:38,049 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:35:38,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38 WrapperNode [2022-01-11 03:35:38,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:38,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:38,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:35:38,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:35:38,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,155 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-11 03:35:38,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:38,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:35:38,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:35:38,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:35:38,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:35:38,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:35:38,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:35:38,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:35:38,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (1/1) ... [2022-01-11 03:35:38,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:38,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:35:38,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:35:38,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:35:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:35:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:35:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:35:38,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:35:38,396 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:35:38,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:35:39,310 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:35:39,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:35:39,320 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:35:39,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:39 BoogieIcfgContainer [2022-01-11 03:35:39,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:35:39,323 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:35:39,323 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:35:39,324 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:35:39,327 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:39" (1/1) ... [2022-01-11 03:35:39,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:39 BasicIcfg [2022-01-11 03:35:39,595 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:35:39,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:35:39,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:35:39,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:35:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:35:37" (1/4) ... [2022-01-11 03:35:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550017b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:39, skipping insertion in model container [2022-01-11 03:35:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:38" (2/4) ... [2022-01-11 03:35:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550017b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:39, skipping insertion in model container [2022-01-11 03:35:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:39" (3/4) ... [2022-01-11 03:35:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550017b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:39, skipping insertion in model container [2022-01-11 03:35:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:39" (4/4) ... [2022-01-11 03:35:39,601 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label30.cTransformedIcfg [2022-01-11 03:35:39,609 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:35:39,609 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:35:39,662 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:35:39,670 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:35:39,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:35:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-11 03:35:39,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:39,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:39,704 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1141792381, now seen corresponding path program 1 times [2022-01-11 03:35:39,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769738477] [2022-01-11 03:35:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:39,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:40,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769738477] [2022-01-11 03:35:40,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769738477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:40,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:40,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:40,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403907325] [2022-01-11 03:35:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:40,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:40,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:40,339 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 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:41,603 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2022-01-11 03:35:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:35:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-01-11 03:35:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:41,617 INFO L225 Difference]: With dead ends: 662 [2022-01-11 03:35:41,617 INFO L226 Difference]: Without dead ends: 397 [2022-01-11 03:35:41,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:35:41,623 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 302 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:41,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 81 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-11 03:35:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-01-11 03:35:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-01-11 03:35:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2022-01-11 03:35:41,676 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 125 [2022-01-11 03:35:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:41,677 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2022-01-11 03:35:41,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2022-01-11 03:35:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 03:35:41,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:41,680 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:41,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:35:41,681 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash 716743799, now seen corresponding path program 1 times [2022-01-11 03:35:41,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:41,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399238227] [2022-01-11 03:35:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:41,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:41,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399238227] [2022-01-11 03:35:41,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399238227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:41,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:41,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:41,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450121007] [2022-01-11 03:35:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:41,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:41,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:41,988 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:42,809 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2022-01-11 03:35:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 03:35:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:42,820 INFO L225 Difference]: With dead ends: 887 [2022-01-11 03:35:42,820 INFO L226 Difference]: Without dead ends: 528 [2022-01-11 03:35:42,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:42,830 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 130 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:42,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 03:35:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-11 03:35:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2022-01-11 03:35:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2022-01-11 03:35:42,849 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 132 [2022-01-11 03:35:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:42,849 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2022-01-11 03:35:42,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2022-01-11 03:35:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-11 03:35:42,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:42,852 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:42,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:35:42,853 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1969358944, now seen corresponding path program 1 times [2022-01-11 03:35:42,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:42,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815205796] [2022-01-11 03:35:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:42,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:42,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815205796] [2022-01-11 03:35:42,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815205796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:42,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:42,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:42,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306922711] [2022-01-11 03:35:42,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:42,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:42,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:42,955 INFO L87 Difference]: Start difference. First operand 397 states and 474 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-11 03:35:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:43,342 INFO L93 Difference]: Finished difference Result 923 states and 1105 transitions. [2022-01-11 03:35:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:43,347 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 140 [2022-01-11 03:35:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:43,349 INFO L225 Difference]: With dead ends: 923 [2022-01-11 03:35:43,349 INFO L226 Difference]: Without dead ends: 528 [2022-01-11 03:35:43,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:43,351 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:43,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 46 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-11 03:35:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-11 03:35:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions. [2022-01-11 03:35:43,367 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 140 [2022-01-11 03:35:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:43,367 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 617 transitions. [2022-01-11 03:35:43,367 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-11 03:35:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions. [2022-01-11 03:35:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-01-11 03:35:43,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:43,370 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:43,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:35:43,370 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2068912992, now seen corresponding path program 1 times [2022-01-11 03:35:43,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429106555] [2022-01-11 03:35:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:43,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:35:43,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:43,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429106555] [2022-01-11 03:35:43,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429106555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:43,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:43,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:43,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158205649] [2022-01-11 03:35:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:43,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:43,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:43,441 INFO L87 Difference]: Start difference. First operand 528 states and 617 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:43,876 INFO L93 Difference]: Finished difference Result 1578 states and 1846 transitions. [2022-01-11 03:35:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 149 [2022-01-11 03:35:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:43,881 INFO L225 Difference]: With dead ends: 1578 [2022-01-11 03:35:43,881 INFO L226 Difference]: Without dead ends: 1052 [2022-01-11 03:35:43,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:43,890 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:43,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-01-11 03:35:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2022-01-11 03:35:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1891304347826086) internal successors, (1094), 920 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1094 transitions. [2022-01-11 03:35:43,917 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1094 transitions. Word has length 149 [2022-01-11 03:35:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:43,918 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1094 transitions. [2022-01-11 03:35:43,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1094 transitions. [2022-01-11 03:35:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-11 03:35:43,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:43,922 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:35:43,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:35:43,922 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -672970374, now seen corresponding path program 1 times [2022-01-11 03:35:43,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679927875] [2022-01-11 03:35:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:43,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:44,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:44,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679927875] [2022-01-11 03:35:44,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679927875] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:44,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:44,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:44,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272829373] [2022-01-11 03:35:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:44,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:44,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:44,063 INFO L87 Difference]: Start difference. First operand 921 states and 1094 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:44,529 INFO L93 Difference]: Finished difference Result 2102 states and 2479 transitions. [2022-01-11 03:35:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-11 03:35:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:44,533 INFO L225 Difference]: With dead ends: 2102 [2022-01-11 03:35:44,534 INFO L226 Difference]: Without dead ends: 1183 [2022-01-11 03:35:44,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:44,536 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:44,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-01-11 03:35:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2022-01-11 03:35:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1455756422454806) internal successors, (1204), 1051 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1204 transitions. [2022-01-11 03:35:44,556 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1204 transitions. Word has length 155 [2022-01-11 03:35:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:44,557 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1204 transitions. [2022-01-11 03:35:44,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1204 transitions. [2022-01-11 03:35:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-11 03:35:44,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:44,560 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:44,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:35:44,560 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2003979060, now seen corresponding path program 1 times [2022-01-11 03:35:44,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:44,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793170789] [2022-01-11 03:35:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:44,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:44,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793170789] [2022-01-11 03:35:44,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793170789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:44,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:44,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:44,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236620846] [2022-01-11 03:35:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:44,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:44,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:44,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:44,661 INFO L87 Difference]: Start difference. First operand 1052 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:45,109 INFO L93 Difference]: Finished difference Result 2495 states and 2883 transitions. [2022-01-11 03:35:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:45,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 169 [2022-01-11 03:35:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:45,115 INFO L225 Difference]: With dead ends: 2495 [2022-01-11 03:35:45,115 INFO L226 Difference]: Without dead ends: 1445 [2022-01-11 03:35:45,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:45,118 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:45,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 187 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-01-11 03:35:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2022-01-11 03:35:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.123961218836565) internal successors, (1623), 1444 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1623 transitions. [2022-01-11 03:35:45,143 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1623 transitions. Word has length 169 [2022-01-11 03:35:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:45,144 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1623 transitions. [2022-01-11 03:35:45,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1623 transitions. [2022-01-11 03:35:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 03:35:45,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:45,147 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:45,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:35:45,148 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -842015831, now seen corresponding path program 1 times [2022-01-11 03:35:45,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:45,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523399068] [2022-01-11 03:35:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:45,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:45,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:45,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523399068] [2022-01-11 03:35:45,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523399068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:45,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:45,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:45,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777285690] [2022-01-11 03:35:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:45,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:45,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:45,254 INFO L87 Difference]: Start difference. First operand 1445 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:45,691 INFO L93 Difference]: Finished difference Result 3281 states and 3713 transitions. [2022-01-11 03:35:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 172 [2022-01-11 03:35:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:45,697 INFO L225 Difference]: With dead ends: 3281 [2022-01-11 03:35:45,698 INFO L226 Difference]: Without dead ends: 1838 [2022-01-11 03:35:45,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:45,701 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:45,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 39 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-11 03:35:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2022-01-11 03:35:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1295238095238096) internal successors, (1779), 1575 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1779 transitions. [2022-01-11 03:35:45,729 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1779 transitions. Word has length 172 [2022-01-11 03:35:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:45,730 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1779 transitions. [2022-01-11 03:35:45,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1779 transitions. [2022-01-11 03:35:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-11 03:35:45,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:45,734 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:45,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:35:45,734 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash -756340128, now seen corresponding path program 1 times [2022-01-11 03:35:45,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:45,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105333722] [2022-01-11 03:35:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:45,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-11 03:35:45,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105333722] [2022-01-11 03:35:45,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105333722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:45,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:45,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:35:45,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534703767] [2022-01-11 03:35:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:45,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:45,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:45,863 INFO L87 Difference]: Start difference. First operand 1576 states and 1779 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:46,579 INFO L93 Difference]: Finished difference Result 3674 states and 4163 transitions. [2022-01-11 03:35:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 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 200 [2022-01-11 03:35:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:46,586 INFO L225 Difference]: With dead ends: 3674 [2022-01-11 03:35:46,587 INFO L226 Difference]: Without dead ends: 2100 [2022-01-11 03:35:46,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:46,590 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 233 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:46,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 20 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-01-11 03:35:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2022-01-11 03:35:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1317365269461077) internal successors, (2079), 1837 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2079 transitions. [2022-01-11 03:35:46,631 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2079 transitions. Word has length 200 [2022-01-11 03:35:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:46,633 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2079 transitions. [2022-01-11 03:35:46,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2079 transitions. [2022-01-11 03:35:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-11 03:35:46,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:46,637 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-01-11 03:35:46,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:35:46,638 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:46,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1239741624, now seen corresponding path program 1 times [2022-01-11 03:35:46,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:46,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610891609] [2022-01-11 03:35:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:46,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-11 03:35:46,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:46,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610891609] [2022-01-11 03:35:46,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610891609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:46,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:46,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:46,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611383835] [2022-01-11 03:35:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:46,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:46,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:46,773 INFO L87 Difference]: Start difference. First operand 1838 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:47,231 INFO L93 Difference]: Finished difference Result 3805 states and 4312 transitions. [2022-01-11 03:35:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 209 [2022-01-11 03:35:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:47,237 INFO L225 Difference]: With dead ends: 3805 [2022-01-11 03:35:47,238 INFO L226 Difference]: Without dead ends: 1969 [2022-01-11 03:35:47,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:47,243 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 74 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:47,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-11 03:35:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-01-11 03:35:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1213935764833969) internal successors, (2060), 1837 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2060 transitions. [2022-01-11 03:35:47,280 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2060 transitions. Word has length 209 [2022-01-11 03:35:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:47,280 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2060 transitions. [2022-01-11 03:35:47,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2060 transitions. [2022-01-11 03:35:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-01-11 03:35:47,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:47,288 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:47,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:35:47,289 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -596666434, now seen corresponding path program 1 times [2022-01-11 03:35:47,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:47,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630804038] [2022-01-11 03:35:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:47,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-11 03:35:47,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:47,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630804038] [2022-01-11 03:35:47,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630804038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:47,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:47,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:47,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578689972] [2022-01-11 03:35:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:47,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:47,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:47,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:47,466 INFO L87 Difference]: Start difference. First operand 1838 states and 2060 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:47,910 INFO L93 Difference]: Finished difference Result 3805 states and 4295 transitions. [2022-01-11 03:35:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:47,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 265 [2022-01-11 03:35:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:47,917 INFO L225 Difference]: With dead ends: 3805 [2022-01-11 03:35:47,918 INFO L226 Difference]: Without dead ends: 1969 [2022-01-11 03:35:47,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:47,921 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:47,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-11 03:35:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2022-01-11 03:35:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1189024390243902) internal successors, (2202), 1968 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2202 transitions. [2022-01-11 03:35:47,957 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2202 transitions. Word has length 265 [2022-01-11 03:35:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:47,958 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2202 transitions. [2022-01-11 03:35:47,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2202 transitions. [2022-01-11 03:35:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-01-11 03:35:47,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:47,963 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:47,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:35:47,964 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1652837920, now seen corresponding path program 1 times [2022-01-11 03:35:47,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723248331] [2022-01-11 03:35:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:47,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-11 03:35:48,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723248331] [2022-01-11 03:35:48,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723248331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:48,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:48,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:35:48,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249707011] [2022-01-11 03:35:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:48,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:35:48,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:35:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:35:48,313 INFO L87 Difference]: Start difference. First operand 1969 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:49,093 INFO L93 Difference]: Finished difference Result 4142 states and 4638 transitions. [2022-01-11 03:35:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:35:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 267 [2022-01-11 03:35:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:49,099 INFO L225 Difference]: With dead ends: 4142 [2022-01-11 03:35:49,099 INFO L226 Difference]: Without dead ends: 1969 [2022-01-11 03:35:49,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:35:49,102 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 231 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:49,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 29 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-11 03:35:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2022-01-11 03:35:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1026422764227641) internal successors, (2170), 1968 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2170 transitions. [2022-01-11 03:35:49,138 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2170 transitions. Word has length 267 [2022-01-11 03:35:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:49,138 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2170 transitions. [2022-01-11 03:35:49,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2170 transitions. [2022-01-11 03:35:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-01-11 03:35:49,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:49,143 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:49,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:35:49,144 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -632052909, now seen corresponding path program 1 times [2022-01-11 03:35:49,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789816001] [2022-01-11 03:35:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:49,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-01-11 03:35:49,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789816001] [2022-01-11 03:35:49,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789816001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:49,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:49,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:49,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000060159] [2022-01-11 03:35:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:49,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:49,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:49,384 INFO L87 Difference]: Start difference. First operand 1969 states and 2170 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:49,794 INFO L93 Difference]: Finished difference Result 4460 states and 4904 transitions. [2022-01-11 03:35:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2022-01-11 03:35:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:49,803 INFO L225 Difference]: With dead ends: 4460 [2022-01-11 03:35:49,803 INFO L226 Difference]: Without dead ends: 2100 [2022-01-11 03:35:49,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:49,807 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:49,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 178 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-01-11 03:35:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2022-01-11 03:35:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.0786088613625535) internal successors, (2264), 2099 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2264 transitions. [2022-01-11 03:35:49,844 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2264 transitions. Word has length 276 [2022-01-11 03:35:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:49,845 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2264 transitions. [2022-01-11 03:35:49,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2264 transitions. [2022-01-11 03:35:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-01-11 03:35:49,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:49,853 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:35:49,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:35:49,854 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 796514419, now seen corresponding path program 1 times [2022-01-11 03:35:49,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:49,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425775632] [2022-01-11 03:35:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:49,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-01-11 03:35:50,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425775632] [2022-01-11 03:35:50,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425775632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:50,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:50,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:50,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734518796] [2022-01-11 03:35:50,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:50,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:50,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:50,231 INFO L87 Difference]: Start difference. First operand 2100 states and 2264 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:50,605 INFO L93 Difference]: Finished difference Result 2181 states and 2345 transitions. [2022-01-11 03:35:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 309 [2022-01-11 03:35:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:50,606 INFO L225 Difference]: With dead ends: 2181 [2022-01-11 03:35:50,606 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:35:50,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:50,609 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:50,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 14 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:35:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:35:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:35:50,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2022-01-11 03:35:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:50,610 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:35:50,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:35:50,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:35:50,613 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:35:50,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:35:50,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:35:51,132 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:35:51,132 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse0 (<= ~a8~0Int 13)) (.cse4 (<= ~a20~0Int 0)) (.cse3 (<= ~a16~0Int 5)) (.cse1 (= ~a20~0Int 1)) (.cse5 (= ~a21~0Int 1)) (.cse6 (= 5 ~a16~0Int)) (.cse7 (= ~a17~0Int 0)) (.cse2 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse2) (and (<= ~a16~0Int 4) .cse4 .cse2) (and .cse5 .cse4 (= ~a8~0Int 14) .cse6 .cse2 .cse7) (and .cse3 .cse5 (<= 5 ~a16~0Int) .cse1 .cse2) (and (= ~a20~0Int 0) .cse5 (= ~a8~0Int 15) .cse6 .cse2 .cse7) (and (not (= ~a7~0Int 1)) .cse2))) [2022-01-11 03:35:51,133 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse0 (<= ~a8~0Int 13)) (.cse4 (<= ~a20~0Int 0)) (.cse3 (<= ~a16~0Int 5)) (.cse1 (= ~a20~0Int 1)) (.cse5 (= ~a21~0Int 1)) (.cse6 (= 5 ~a16~0Int)) (.cse7 (= ~a17~0Int 0)) (.cse2 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse2) (and (<= ~a16~0Int 4) .cse4 .cse2) (and .cse5 .cse4 (= ~a8~0Int 14) .cse6 .cse2 .cse7) (and .cse3 .cse5 (<= 5 ~a16~0Int) .cse1 .cse2) (and (= ~a20~0Int 0) .cse5 (= ~a8~0Int 15) .cse6 .cse2 .cse7) (and (not (= ~a7~0Int 1)) .cse2))) [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-11 03:35:51,133 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-11 03:35:51,134 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-11 03:35:51,135 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-11 03:35:51,136 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-11 03:35:51,137 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-11 03:35:51,138 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,139 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,140 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,141 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-11 03:35:51,142 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,143 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,144 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,145 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,146 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-11 03:35:51,147 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 561) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,148 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-11 03:35:51,149 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:51,149 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-11 03:35:51,149 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-11 03:35:51,152 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:51,153 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:35:51,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:51 BasicIcfg [2022-01-11 03:35:51,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:35:51,173 INFO L158 Benchmark]: Toolchain (without parser) took 13657.32ms. Allocated memory was 203.4MB in the beginning and 362.8MB in the end (delta: 159.4MB). Free memory was 144.7MB in the beginning and 132.1MB in the end (delta: 12.6MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,173 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:35:51,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.61ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 144.4MB in the beginning and 219.5MB in the end (delta: -75.0MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.61ms. Allocated memory is still 268.4MB. Free memory was 219.5MB in the beginning and 213.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,173 INFO L158 Benchmark]: Boogie Preprocessor took 73.33ms. Allocated memory is still 268.4MB. Free memory was 213.7MB in the beginning and 209.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,174 INFO L158 Benchmark]: RCFGBuilder took 1086.25ms. Allocated memory is still 268.4MB. Free memory was 209.5MB in the beginning and 149.7MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,174 INFO L158 Benchmark]: IcfgTransformer took 271.69ms. Allocated memory is still 268.4MB. Free memory was 149.7MB in the beginning and 201.4MB in the end (delta: -51.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,174 INFO L158 Benchmark]: TraceAbstraction took 11575.78ms. Allocated memory was 268.4MB in the beginning and 362.8MB in the end (delta: 94.4MB). Free memory was 200.9MB in the beginning and 132.1MB in the end (delta: 68.8MB). Peak memory consumption was 163.2MB. Max. memory is 8.0GB. [2022-01-11 03:35:51,176 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.12ms. Allocated memory is still 203.4MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.61ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 144.4MB in the beginning and 219.5MB in the end (delta: -75.0MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 110.61ms. Allocated memory is still 268.4MB. Free memory was 219.5MB in the beginning and 213.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.33ms. Allocated memory is still 268.4MB. Free memory was 213.7MB in the beginning and 209.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1086.25ms. Allocated memory is still 268.4MB. Free memory was 209.5MB in the beginning and 149.7MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * IcfgTransformer took 271.69ms. Allocated memory is still 268.4MB. Free memory was 149.7MB in the beginning and 201.4MB in the end (delta: -51.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11575.78ms. Allocated memory was 268.4MB in the beginning and 362.8MB in the end (delta: 94.4MB). Free memory was 200.9MB in the beginning and 132.1MB in the end (delta: 68.8MB). Peak memory consumption was 163.2MB. 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: 561]: 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: 11.5s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1822 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1822 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 867 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5528 IncrementalHoareTripleChecker+Invalid, 6395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 867 mSolverCounterUnsat, 899 mSDtfsCounter, 5528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 187 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1920 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4182 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2568 NumberOfCodeBlocks, 2568 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2555 ConstructedInterpolants, 0 QuantifiedInterpolants, 16160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1702/1702 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) || (((((8bv32 == a12 && 0bv32 == a17) && 14bv32 == a8) && ~bvule32(a20, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || (8bv32 == a12 && !(a7 == 1bv32))) || ((8bv32 == a12 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32))) || (((((8bv32 == a12 && a8 == 15bv32) && 0bv32 == a20) && 0bv32 == a17) && 5bv32 == a16) && 1bv32 == a21)) || ((8bv32 == a12 && ~bvule32(a16, 4bv32)) && ~bvule32(a20, 0bv32)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) || (((((8bv32 == a12 && 0bv32 == a17) && 14bv32 == a8) && ~bvule32(a20, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || (8bv32 == a12 && !(a7 == 1bv32))) || ((8bv32 == a12 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32))) || (((((8bv32 == a12 && a8 == 15bv32) && 0bv32 == a20) && 0bv32 == a17) && 5bv32 == a16) && 1bv32 == a21)) || ((8bv32 == a12 && ~bvule32(a16, 4bv32)) && ~bvule32(a20, 0bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:35:51,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...