/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:25:21,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:25:21,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:25:21,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:25:21,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:25:21,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:25:21,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:25:21,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:25:21,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:25:21,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:25:21,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:25:21,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:25:21,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:25:21,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:25:21,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:25:21,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:25:21,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:25:21,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:25:21,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:25:21,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:25:21,323 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:25:21,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:25:21,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:25:21,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:25:21,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:25:21,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:25:21,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:25:21,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:25:21,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:25:21,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:25:21,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:25:21,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:25:21,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:25:21,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:25:21,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:25:21,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:25:21,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:25:21,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:25:21,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:25:21,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:25:21,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:25:21,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:25:21,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:25:21,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:25:21,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:25:21,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:25:21,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:25:21,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:25:21,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:25:21,356 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:25:21,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:25:21,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:25:21,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:25:21,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:25:21,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:25:21,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:25:21,359 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:25:21,359 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-05 05:25:21,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:25:21,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:25:21,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:25:21,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:25:21,549 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:25:21,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-04-05 05:25:21,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437844e61/b54b7144013049d8897b374130da4b62/FLAGd558b6c64 [2022-04-05 05:25:21,921 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:25:21,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-04-05 05:25:21,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437844e61/b54b7144013049d8897b374130da4b62/FLAGd558b6c64 [2022-04-05 05:25:22,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437844e61/b54b7144013049d8897b374130da4b62 [2022-04-05 05:25:22,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:25:22,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:25:22,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:25:22,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:25:22,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:25:22,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e59d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22, skipping insertion in model container [2022-04-05 05:25:22,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:25:22,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:25:22,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-04-05 05:25:22,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:25:22,527 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:25:22,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-04-05 05:25:22,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:25:22,551 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:25:22,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22 WrapperNode [2022-04-05 05:25:22,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:25:22,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:25:22,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:25:22,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:25:22,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:25:22,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:25:22,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:25:22,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:25:22,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:25:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:22,612 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-04-05 05:25:22,628 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-04-05 05:25:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:25:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:25:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:25:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 05:25:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:25:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:25:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:25:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:25:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:25:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:25:22,689 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:25:22,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:25:22,848 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:25:22,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:25:22,852 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-05 05:25:22,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:25:22 BoogieIcfgContainer [2022-04-05 05:25:22,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:25:22,854 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:25:22,854 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:25:22,855 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:25:22,857 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:25:22" (1/1) ... [2022-04-05 05:25:22,858 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:25:22,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:25:22 BasicIcfg [2022-04-05 05:25:22,878 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:25:22,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:25:22,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:25:22,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:25:22,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:25:22" (1/4) ... [2022-04-05 05:25:22,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c20c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:25:22, skipping insertion in model container [2022-04-05 05:25:22,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:25:22" (2/4) ... [2022-04-05 05:25:22,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c20c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:25:22, skipping insertion in model container [2022-04-05 05:25:22,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:25:22" (3/4) ... [2022-04-05 05:25:22,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c20c56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:25:22, skipping insertion in model container [2022-04-05 05:25:22,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:25:22" (4/4) ... [2022-04-05 05:25:22,885 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.cqvasr [2022-04-05 05:25:22,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:25:22,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 05:25:22,915 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:25:22,920 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-05 05:25:22,920 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 05:25:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:25:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-05 05:25:22,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:22,934 INFO L499 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] [2022-04-05 05:25:22,935 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 538022728, now seen corresponding path program 1 times [2022-04-05 05:25:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:22,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069893547] [2022-04-05 05:25:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:23,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069893547] [2022-04-05 05:25:23,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069893547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:25:23,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:25:23,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 05:25:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475237018] [2022-04-05 05:25:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:25:23,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 05:25:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 05:25:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 05:25:23,120 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:23,327 INFO L93 Difference]: Finished difference Result 60 states and 98 transitions. [2022-04-05 05:25:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 05:25:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-05 05:25:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:23,342 INFO L225 Difference]: With dead ends: 60 [2022-04-05 05:25:23,343 INFO L226 Difference]: Without dead ends: 47 [2022-04-05 05:25:23,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04-05 05:25:23,355 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:23,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 22 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:25:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-05 05:25:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-04-05 05:25:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-05 05:25:23,384 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 27 [2022-04-05 05:25:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:23,385 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-05 05:25:23,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-05 05:25:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-05 05:25:23,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:23,386 INFO L499 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] [2022-04-05 05:25:23,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:25:23,387 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash 538052519, now seen corresponding path program 1 times [2022-04-05 05:25:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:23,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483541787] [2022-04-05 05:25:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483541787] [2022-04-05 05:25:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483541787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:25:23,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:25:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 05:25:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069829650] [2022-04-05 05:25:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:25:23,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 05:25:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 05:25:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:25:23,526 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:23,697 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-05 05:25:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 05:25:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-05 05:25:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:23,698 INFO L225 Difference]: With dead ends: 52 [2022-04-05 05:25:23,699 INFO L226 Difference]: Without dead ends: 30 [2022-04-05 05:25:23,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-04-05 05:25:23,704 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:23,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:25:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-05 05:25:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-05 05:25:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-05 05:25:23,717 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2022-04-05 05:25:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:23,717 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-05 05:25:23,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-05 05:25:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-05 05:25:23,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:23,719 INFO L499 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] [2022-04-05 05:25:23,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:25:23,719 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1642813573, now seen corresponding path program 1 times [2022-04-05 05:25:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:23,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920407744] [2022-04-05 05:25:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920407744] [2022-04-05 05:25:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920407744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:25:23,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:25:23,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 05:25:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020509223] [2022-04-05 05:25:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:25:23,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 05:25:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 05:25:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-05 05:25:23,858 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:24,038 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-05 05:25:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 05:25:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-05 05:25:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:24,042 INFO L225 Difference]: With dead ends: 38 [2022-04-05 05:25:24,042 INFO L226 Difference]: Without dead ends: 32 [2022-04-05 05:25:24,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-04-05 05:25:24,046 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:24,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 27 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:25:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-05 05:25:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-05 05:25:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-05 05:25:24,056 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2022-04-05 05:25:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:24,056 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-05 05:25:24,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-05 05:25:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-05 05:25:24,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:24,057 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 05:25:24,057 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 05:25:24,058 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1833702941, now seen corresponding path program 1 times [2022-04-05 05:25:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:24,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023314540] [2022-04-05 05:25:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023314540] [2022-04-05 05:25:24,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023314540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:24,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426571596] [2022-04-05 05:25:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:24,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:24,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:24,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 05:25:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:24,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-05 05:25:24,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:24,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:24,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426571596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:24,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:24,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-05 05:25:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956680574] [2022-04-05 05:25:24,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:24,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 05:25:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 05:25:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-05 05:25:24,523 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:24,908 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-04-05 05:25:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-05 05:25:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-05 05:25:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:24,910 INFO L225 Difference]: With dead ends: 62 [2022-04-05 05:25:24,910 INFO L226 Difference]: Without dead ends: 56 [2022-04-05 05:25:24,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2022-04-05 05:25:24,911 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:24,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 22 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:25:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-05 05:25:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-05 05:25:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-04-05 05:25:24,917 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 31 [2022-04-05 05:25:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:24,917 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-04-05 05:25:24,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-05 05:25:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-05 05:25:24,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:24,918 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 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-04-05 05:25:24,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:25,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:25,119 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 171106635, now seen corresponding path program 2 times [2022-04-05 05:25:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849116962] [2022-04-05 05:25:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849116962] [2022-04-05 05:25:25,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849116962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715408136] [2022-04-05 05:25:25,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:25:25,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:25,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:25,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 05:25:25,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:25:25,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:25:25,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-05 05:25:25,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:25,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:26,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715408136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:26,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:26,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-05 05:25:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539079434] [2022-04-05 05:25:26,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:26,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-05 05:25:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-05 05:25:26,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-05 05:25:26,226 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:27,313 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2022-04-05 05:25:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-05 05:25:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-05 05:25:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:27,314 INFO L225 Difference]: With dead ends: 110 [2022-04-05 05:25:27,314 INFO L226 Difference]: Without dead ends: 104 [2022-04-05 05:25:27,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2022-04-05 05:25:27,318 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 158 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:27,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 42 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:25:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-05 05:25:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-05 05:25:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-04-05 05:25:27,326 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 55 [2022-04-05 05:25:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:27,326 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-04-05 05:25:27,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.06) internal successors, (103), 49 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-04-05 05:25:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-05 05:25:27,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:27,328 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 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-04-05 05:25:27,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:27,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:27,538 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1936218085, now seen corresponding path program 3 times [2022-04-05 05:25:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:27,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929721002] [2022-04-05 05:25:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929721002] [2022-04-05 05:25:28,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929721002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891090346] [2022-04-05 05:25:28,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 05:25:28,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:28,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:28,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 05:25:28,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-05 05:25:28,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:25:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-05 05:25:28,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2022-04-05 05:25:28,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2022-04-05 05:25:28,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891090346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:28,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:28,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 4, 4] total 54 [2022-04-05 05:25:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87158019] [2022-04-05 05:25:28,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:28,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-05 05:25:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-05 05:25:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-05 05:25:28,738 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 53 states have internal predecessors, (130), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:30,089 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-04-05 05:25:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-05 05:25:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 53 states have internal predecessors, (130), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-05 05:25:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:30,091 INFO L225 Difference]: With dead ends: 118 [2022-04-05 05:25:30,091 INFO L226 Difference]: Without dead ends: 112 [2022-04-05 05:25:30,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2022-04-05 05:25:30,096 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 147 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:30,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:25:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-05 05:25:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-05 05:25:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-04-05 05:25:30,104 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 103 [2022-04-05 05:25:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:30,104 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-04-05 05:25:30,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 53 states have internal predecessors, (130), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-04-05 05:25:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-05 05:25:30,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:30,105 INFO L499 BasicCegarLoop]: trace histogram [42, 38, 4, 1, 1, 1, 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-04-05 05:25:30,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:30,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:30,323 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1431719632, now seen corresponding path program 4 times [2022-04-05 05:25:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566755916] [2022-04-05 05:25:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 05:25:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566755916] [2022-04-05 05:25:31,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566755916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197613273] [2022-04-05 05:25:31,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 05:25:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:31,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:31,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 05:25:31,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 05:25:31,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:25:31,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-05 05:25:31,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 05:25:31,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 05:25:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197613273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:31,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:31,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 54 [2022-04-05 05:25:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200219211] [2022-04-05 05:25:31,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:31,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-05 05:25:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-05 05:25:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-05 05:25:31,682 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 53 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:32,857 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-04-05 05:25:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-05 05:25:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 53 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-05 05:25:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:32,858 INFO L225 Difference]: With dead ends: 130 [2022-04-05 05:25:32,858 INFO L226 Difference]: Without dead ends: 118 [2022-04-05 05:25:32,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2022-04-05 05:25:32,861 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:32,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 37 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:25:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-05 05:25:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-05 05:25:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-04-05 05:25:32,868 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 111 [2022-04-05 05:25:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:32,868 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-04-05 05:25:32,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.4444444444444446) internal successors, (132), 53 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-04-05 05:25:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-05 05:25:32,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:32,869 INFO L499 BasicCegarLoop]: trace histogram [45, 41, 4, 1, 1, 1, 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-04-05 05:25:32,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:33,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:33,086 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1878629302, now seen corresponding path program 5 times [2022-04-05 05:25:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:33,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778983749] [2022-04-05 05:25:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:34,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778983749] [2022-04-05 05:25:34,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778983749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:34,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948903278] [2022-04-05 05:25:34,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 05:25:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:34,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:34,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 05:25:34,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2022-04-05 05:25:34,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:25:34,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-05 05:25:34,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-04-05 05:25:34,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-04-05 05:25:36,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948903278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:36,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:36,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 25, 25] total 99 [2022-04-05 05:25:36,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459085097] [2022-04-05 05:25:36,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:36,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-04-05 05:25:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-04-05 05:25:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2022-04-05 05:25:36,185 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 99 states, 99 states have (on average 2.2626262626262625) internal successors, (224), 98 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:40,079 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2022-04-05 05:25:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-05 05:25:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 2.2626262626262625) internal successors, (224), 98 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-05 05:25:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:40,080 INFO L225 Difference]: With dead ends: 205 [2022-04-05 05:25:40,081 INFO L226 Difference]: Without dead ends: 202 [2022-04-05 05:25:40,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2022-04-05 05:25:40,085 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 233 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:40,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 51 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 05:25:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-05 05:25:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-04-05 05:25:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.2373737373737375) internal successors, (245), 198 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 248 transitions. [2022-04-05 05:25:40,094 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 248 transitions. Word has length 117 [2022-04-05 05:25:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:40,095 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 248 transitions. [2022-04-05 05:25:40,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 2.2626262626262625) internal successors, (224), 98 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 248 transitions. [2022-04-05 05:25:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-05 05:25:40,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:40,100 INFO L499 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 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-04-05 05:25:40,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:40,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:40,304 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1130384116, now seen corresponding path program 6 times [2022-04-05 05:25:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:40,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948287757] [2022-04-05 05:25:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:25:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948287757] [2022-04-05 05:25:43,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948287757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473334178] [2022-04-05 05:25:43,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-05 05:25:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:43,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:43,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 05:25:43,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2022-04-05 05:25:43,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:25:43,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-05 05:25:43,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2022-04-05 05:25:43,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2022-04-05 05:25:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473334178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:43,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:43,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 49, 49] total 103 [2022-04-05 05:25:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235188653] [2022-04-05 05:25:43,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:43,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-04-05 05:25:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-04-05 05:25:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2022-04-05 05:25:43,973 INFO L87 Difference]: Start difference. First operand 202 states and 248 transitions. Second operand has 103 states, 103 states have (on average 2.2233009708737863) internal successors, (229), 102 states have internal predecessors, (229), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:48,281 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-04-05 05:25:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-05 05:25:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.2233009708737863) internal successors, (229), 102 states have internal predecessors, (229), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-05 05:25:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:48,294 INFO L225 Difference]: With dead ends: 213 [2022-04-05 05:25:48,294 INFO L226 Difference]: Without dead ends: 210 [2022-04-05 05:25:48,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2022-04-05 05:25:48,298 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 227 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:48,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 61 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 05:25:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-05 05:25:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-05 05:25:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 206 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 260 transitions. [2022-04-05 05:25:48,314 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 260 transitions. Word has length 201 [2022-04-05 05:25:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:48,314 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 260 transitions. [2022-04-05 05:25:48,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.2233009708737863) internal successors, (229), 102 states have internal predecessors, (229), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 260 transitions. [2022-04-05 05:25:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-04-05 05:25:48,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:48,316 INFO L499 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 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-04-05 05:25:48,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:48,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:48,529 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 604234368, now seen corresponding path program 7 times [2022-04-05 05:25:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577045737] [2022-04-05 05:25:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-04-05 05:25:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577045737] [2022-04-05 05:25:49,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577045737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:25:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119801607] [2022-04-05 05:25:49,678 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-05 05:25:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:25:49,679 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:25:49,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 05:25:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:49,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-05 05:25:49,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:25:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-04-05 05:25:50,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:25:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-04-05 05:25:51,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119801607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:25:51,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:25:51,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2022-04-05 05:25:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807204992] [2022-04-05 05:25:51,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:25:51,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-05 05:25:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-05 05:25:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2022-04-05 05:25:51,326 INFO L87 Difference]: Start difference. First operand 210 states and 260 transitions. Second operand has 56 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 55 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:55,267 INFO L93 Difference]: Finished difference Result 2864 states and 4239 transitions. [2022-04-05 05:25:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-05 05:25:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 55 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 209 [2022-04-05 05:25:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:55,279 INFO L225 Difference]: With dead ends: 2864 [2022-04-05 05:25:55,279 INFO L226 Difference]: Without dead ends: 2861 [2022-04-05 05:25:55,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 414 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=11235, Unknown=0, NotChecked=0, Total=11556 [2022-04-05 05:25:55,281 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 180 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 9157 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 9209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 9157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:55,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 395 Invalid, 9209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 9157 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-05 05:25:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2022-04-05 05:25:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 212. [2022-04-05 05:25:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 208 states have (on average 1.25) internal successors, (260), 208 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 263 transitions. [2022-04-05 05:25:55,324 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 263 transitions. Word has length 209 [2022-04-05 05:25:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:55,325 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 263 transitions. [2022-04-05 05:25:55,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.2857142857142856) internal successors, (128), 55 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 263 transitions. [2022-04-05 05:25:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-05 05:25:55,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:25:55,327 INFO L499 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 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-04-05 05:25:55,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 05:25:55,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:25:55,536 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:25:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:25:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 847690173, now seen corresponding path program 8 times [2022-04-05 05:25:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:25:55,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501061740] [2022-04-05 05:25:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:25:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:25:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:25:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:25:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-04-05 05:25:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:25:56,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501061740] [2022-04-05 05:25:56,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501061740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:25:56,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:25:56,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-05 05:25:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687835212] [2022-04-05 05:25:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:25:56,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-05 05:25:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:25:56,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-05 05:25:56,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-04-05 05:25:56,397 INFO L87 Difference]: Start difference. First operand 212 states and 263 transitions. Second operand has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:25:57,318 INFO L93 Difference]: Finished difference Result 311 states and 411 transitions. [2022-04-05 05:25:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-05 05:25:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 211 [2022-04-05 05:25:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:25:57,319 INFO L225 Difference]: With dead ends: 311 [2022-04-05 05:25:57,319 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 05:25:57,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2022-04-05 05:25:57,321 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:25:57,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:25:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 05:25:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 05:25:57,321 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-04-05 05:25:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 05:25:57,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2022-04-05 05:25:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:25:57,322 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 05:25:57,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 52 states have internal predecessors, (127), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:25:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 05:25:57,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 05:25:57,324 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 05:25:57,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 05:25:57,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-05 05:26:04,964 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_720~0)| ~__return_720~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-05 05:26:04,965 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 214) the Hoare annotation is: (= |old(~__return_720~0)| ~__return_720~0) [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point L17(lines 17 213) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 208) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 214) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L878 garLoopResultBuilder]: At program point L207(lines 19 208) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 1)) [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 214) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 196) no Hoare annotation was computed. [2022-04-05 05:26:04,965 INFO L878 garLoopResultBuilder]: At program point L195(lines 25 196) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2) (= |old(~__return_720~0)| ~__return_720~0)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 184) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L183(lines 31 184) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 3)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 172) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L171(lines 37 172) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 4) (= |old(~__return_720~0)| ~__return_720~0)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 160) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L159(lines 43 160) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 5)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L49(lines 49 148) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L147(lines 49 148) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0) (<= main_~main__x~0 6)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L55(lines 55 136) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L135(lines 55 136) the Hoare annotation is: (and (<= main_~main__x~0 7) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_720~0)| ~__return_720~0)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 124) no Hoare annotation was computed. [2022-04-05 05:26:04,966 INFO L878 garLoopResultBuilder]: At program point L123(lines 61 124) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 8) (= |old(~__return_720~0)| ~__return_720~0)) [2022-04-05 05:26:04,966 INFO L882 garLoopResultBuilder]: For program point L67(lines 67 112) no Hoare annotation was computed. [2022-04-05 05:26:04,967 INFO L878 garLoopResultBuilder]: At program point L111(lines 67 112) the Hoare annotation is: (let ((.cse0 (= |old(~__return_720~0)| ~__return_720~0))) (or (and (<= main_~main__y~0 72) (<= 72 main_~main__x~0) (<= 72 main_~main__y~0) .cse0 (<= main_~main__x~0 72)) (and (<= 83 main_~main__y~0) (<= main_~main__x~0 83) (<= main_~main__y~0 83) .cse0 (<= 83 main_~main__x~0)) (and (<= 75 main_~main__x~0) (<= main_~main__x~0 75) (<= main_~main__y~0 75) .cse0 (<= 75 main_~main__y~0)) (and (<= main_~main__x~0 64) (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (<= 64 main_~main__x~0)) (and (<= 61 main_~main__x~0) (<= main_~main__x~0 61) (<= main_~main__y~0 61) (<= 61 main_~main__y~0) .cse0) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= 76 main_~main__x~0) .cse0 (<= main_~main__y~0 76) (<= main_~main__x~0 76) (<= 76 main_~main__y~0)) (and (<= 95 main_~main__y~0) .cse0 (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0)) (and (< main_~main__x~0 100) (<= main_~main__y~0 99) (<= 99 main_~main__y~0) .cse0 (<= 99 main_~main__x~0)) (and (<= main_~main__x~0 73) (<= 73 main_~main__y~0) .cse0 (<= main_~main__y~0 73) (<= 73 main_~main__x~0)) (and (<= 96 main_~main__x~0) .cse0 (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= main_~main__x~0 96)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= 92 main_~main__y~0) .cse0 (<= main_~main__y~0 92)) (and (<= 71 main_~main__y~0) (<= main_~main__y~0 71) (<= main_~main__x~0 71) .cse0 (<= 71 main_~main__x~0)) (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= 86 main_~main__y~0) .cse0 (<= main_~main__y~0 86)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= 70 main_~main__y~0) (<= 70 main_~main__x~0) (<= main_~main__y~0 70) .cse0 (<= main_~main__x~0 70)) (and (<= 77 main_~main__x~0) (<= main_~main__y~0 77) .cse0 (<= 77 main_~main__y~0) (<= main_~main__x~0 77)) (and (<= main_~main__x~0 65) (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) .cse0 (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 62) .cse0 (<= main_~main__x~0 62) (<= 62 main_~main__x~0) (<= 62 main_~main__y~0)) (and (<= main_~main__y~0 67) (<= 67 main_~main__y~0) (<= main_~main__x~0 67) .cse0 (<= 67 main_~main__x~0)) (and (<= 100 main_~main__x~0) (< 99 main_~main__y~0) .cse0 (<= main_~main__y~0 100)) (and (<= 80 main_~main__y~0) .cse0 (<= main_~main__y~0 80) (<= main_~main__x~0 80) (<= 80 main_~main__x~0)) (and (<= main_~main__y~0 69) (<= main_~main__x~0 69) (<= 69 main_~main__y~0) .cse0 (<= 69 main_~main__x~0)) (and (<= 91 main_~main__y~0) (<= 91 main_~main__x~0) (<= main_~main__x~0 91) .cse0 (<= main_~main__y~0 91)) (and (<= main_~main__y~0 90) .cse0 (<= main_~main__x~0 90) (<= 90 main_~main__x~0) (<= 90 main_~main__y~0)) (and (<= 82 main_~main__x~0) (<= main_~main__x~0 82) .cse0 (<= 82 main_~main__y~0) (<= main_~main__y~0 82)) (and (<= main_~main__y~0 85) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) .cse0 (<= 85 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= main_~main__y~0 88) .cse0 (<= 88 main_~main__y~0) (<= 88 main_~main__x~0)) (and (<= main_~main__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= main_~main__y~0 66) .cse0 (<= main_~main__x~0 66) (<= 66 main_~main__x~0) (<= 66 main_~main__y~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__y~0) .cse0 (<= 97 main_~main__x~0) (< main_~main__x~0 98)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= 52 main_~main__y~0) (<= 52 main_~main__x~0) .cse0 (<= main_~main__x~0 52) (<= main_~main__y~0 52)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (and (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0) .cse0 (<= main_~main__y~0 74)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= 98 main_~main__x~0) (< main_~main__x~0 99) .cse0) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__x~0 63) (<= main_~main__y~0 63)) (and (<= main_~main__y~0 84) (<= main_~main__x~0 84) (<= 84 main_~main__x~0) (<= 84 main_~main__y~0) .cse0) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50) .cse0) (and (<= 87 main_~main__x~0) (<= 87 main_~main__y~0) (<= main_~main__y~0 87) .cse0 (<= main_~main__x~0 87)) (and (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0) .cse0 (<= main_~main__x~0 78)) (and (<= main_~main__y~0 79) (<= main_~main__x~0 79) .cse0 (<= 79 main_~main__x~0) (<= 79 main_~main__y~0)) (and (<= 81 main_~main__x~0) (<= main_~main__y~0 81) (<= 81 main_~main__y~0) .cse0 (<= main_~main__x~0 81)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) .cse0 (<= 58 main_~main__y~0) (<= 58 main_~main__x~0)) (and (<= main_~main__y~0 68) (<= main_~main__x~0 68) (<= 68 main_~main__y~0) (<= 68 main_~main__x~0) .cse0) (and (<= 93 main_~main__y~0) .cse0 (<= 93 main_~main__x~0) (<= main_~main__x~0 93) (<= main_~main__y~0 93)) (and (<= 94 main_~main__y~0) (<= main_~main__x~0 94) (<= main_~main__y~0 94) .cse0 (<= 94 main_~main__x~0)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)))) [2022-04-05 05:26:04,967 INFO L882 garLoopResultBuilder]: For program point L74(lines 74 85) no Hoare annotation was computed. [2022-04-05 05:26:04,967 INFO L882 garLoopResultBuilder]: For program point L94(lines 94 103) no Hoare annotation was computed. [2022-04-05 05:26:04,967 INFO L882 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2022-04-05 05:26:04,967 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) no Hoare annotation was computed. [2022-04-05 05:26:04,970 INFO L719 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2022-04-05 05:26:04,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 05:26:04,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:26:04 BasicIcfg [2022-04-05 05:26:04,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 05:26:04,991 INFO L158 Benchmark]: Toolchain (without parser) took 42645.34ms. Allocated memory was 188.7MB in the beginning and 343.9MB in the end (delta: 155.2MB). Free memory was 130.8MB in the beginning and 300.2MB in the end (delta: -169.3MB). Peak memory consumption was 182.9MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,991 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 05:26:04,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.72ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 130.7MB in the beginning and 208.4MB in the end (delta: -77.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,991 INFO L158 Benchmark]: Boogie Preprocessor took 22.19ms. Allocated memory is still 238.0MB. Free memory was 208.4MB in the beginning and 206.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,992 INFO L158 Benchmark]: RCFGBuilder took 278.08ms. Allocated memory is still 238.0MB. Free memory was 206.6MB in the beginning and 193.2MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,992 INFO L158 Benchmark]: IcfgTransformer took 23.80ms. Allocated memory is still 238.0MB. Free memory was 193.2MB in the beginning and 191.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,992 INFO L158 Benchmark]: TraceAbstraction took 42110.10ms. Allocated memory was 238.0MB in the beginning and 343.9MB in the end (delta: 105.9MB). Free memory was 191.1MB in the beginning and 300.2MB in the end (delta: -109.0MB). Peak memory consumption was 193.9MB. Max. memory is 8.0GB. [2022-04-05 05:26:04,993 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.72ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 130.7MB in the beginning and 208.4MB in the end (delta: -77.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.19ms. Allocated memory is still 238.0MB. Free memory was 208.4MB in the beginning and 206.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.08ms. Allocated memory is still 238.0MB. Free memory was 206.6MB in the beginning and 193.2MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 23.80ms. Allocated memory is still 238.0MB. Free memory was 193.2MB in the beginning and 191.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 42110.10ms. Allocated memory was 238.0MB in the beginning and 343.9MB in the end (delta: 105.9MB). Free memory was 191.1MB in the beginning and 300.2MB in the end (delta: -109.0MB). Peak memory consumption was 193.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 96]: 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 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 11, TraceHistogramMax: 92, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1263 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1263 mSDsluCounter, 771 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 524 mSDsCounter, 1767 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10981 IncrementalHoareTripleChecker+Invalid, 12748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1767 mSolverCounterUnsat, 247 mSDtfsCounter, 10981 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2728 GetRequests, 1730 SyntacticMatches, 9 SemanticMatches, 989 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17151 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=10, InterpolantAutomatonStates: 520, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 2666 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 113 NumberOfFragments, 933 HoareAnnotationTreeSize, 13 FomulaSimplifications, 2088 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 13 FomulaSimplificationsInter, 17796 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1876 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2750 ConstructedInterpolants, 0 QuantifiedInterpolants, 9123 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2053 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 31437/72314 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: 31]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 3 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 4) && \old(__return_720) == __return_720 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__x <= 7 && main__y <= 50) && 50 <= main__y) && \old(__return_720) == __return_720 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 5 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 6 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((main__y <= 72 && 72 <= main__x) && 72 <= main__y) && \old(__return_720) == __return_720) && main__x <= 72) || ((((83 <= main__y && main__x <= 83) && main__y <= 83) && \old(__return_720) == __return_720) && 83 <= main__x)) || ((((75 <= main__x && main__x <= 75) && main__y <= 75) && \old(__return_720) == __return_720) && 75 <= main__y)) || ((((main__x <= 64 && 64 <= main__y) && \old(__return_720) == __return_720) && main__y <= 64) && 64 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_720) == __return_720)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_720) == __return_720) && 51 <= main__y) && 51 <= main__x)) || ((((76 <= main__x && \old(__return_720) == __return_720) && main__y <= 76) && main__x <= 76) && 76 <= main__y)) || ((((95 <= main__y && \old(__return_720) == __return_720) && main__x <= 95) && main__y <= 95) && 95 <= main__x)) || ((((main__x < 100 && main__y <= 99) && 99 <= main__y) && \old(__return_720) == __return_720) && 99 <= main__x)) || ((((main__x <= 73 && 73 <= main__y) && \old(__return_720) == __return_720) && main__y <= 73) && 73 <= main__x)) || ((((96 <= main__x && \old(__return_720) == __return_720) && main__y <= 96) && 96 <= main__y) && main__x <= 96)) || ((((main__x <= 92 && 92 <= main__x) && 92 <= main__y) && \old(__return_720) == __return_720) && main__y <= 92)) || ((((71 <= main__y && main__y <= 71) && main__x <= 71) && \old(__return_720) == __return_720) && 71 <= main__x)) || ((((main__x <= 56 && \old(__return_720) == __return_720) && 56 <= main__x) && 56 <= main__y) && main__y <= 56)) || ((((86 <= main__x && main__x <= 86) && 86 <= main__y) && \old(__return_720) == __return_720) && main__y <= 86)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_720) == __return_720) && 57 <= main__y)) || ((((70 <= main__y && 70 <= main__x) && main__y <= 70) && \old(__return_720) == __return_720) && main__x <= 70)) || ((((77 <= main__x && main__y <= 77) && \old(__return_720) == __return_720) && 77 <= main__y) && main__x <= 77)) || ((((main__x <= 65 && 65 <= main__x) && 65 <= main__y) && \old(__return_720) == __return_720) && main__y <= 65)) || ((((89 <= main__y && main__y <= 89) && main__x <= 89) && \old(__return_720) == __return_720) && 89 <= main__x)) || ((((main__y <= 62 && \old(__return_720) == __return_720) && main__x <= 62) && 62 <= main__x) && 62 <= main__y)) || ((((main__y <= 67 && 67 <= main__y) && main__x <= 67) && \old(__return_720) == __return_720) && 67 <= main__x)) || (((100 <= main__x && 99 < main__y) && \old(__return_720) == __return_720) && main__y <= 100)) || ((((80 <= main__y && \old(__return_720) == __return_720) && main__y <= 80) && main__x <= 80) && 80 <= main__x)) || ((((main__y <= 69 && main__x <= 69) && 69 <= main__y) && \old(__return_720) == __return_720) && 69 <= main__x)) || ((((91 <= main__y && 91 <= main__x) && main__x <= 91) && \old(__return_720) == __return_720) && main__y <= 91)) || ((((main__y <= 90 && \old(__return_720) == __return_720) && main__x <= 90) && 90 <= main__x) && 90 <= main__y)) || ((((82 <= main__x && main__x <= 82) && \old(__return_720) == __return_720) && 82 <= main__y) && main__y <= 82)) || ((((main__y <= 85 && main__x <= 85) && 85 <= main__x) && \old(__return_720) == __return_720) && 85 <= main__y)) || ((((main__x <= 88 && main__y <= 88) && \old(__return_720) == __return_720) && 88 <= main__y) && 88 <= main__x)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_720) == __return_720) && main__y <= 59)) || ((((53 <= main__y && main__y <= 53) && \old(__return_720) == __return_720) && 53 <= main__x) && main__x <= 53)) || ((((main__y <= 66 && \old(__return_720) == __return_720) && main__x <= 66) && 66 <= main__x) && 66 <= main__y)) || ((((main__y <= 97 && 97 <= main__y) && \old(__return_720) == __return_720) && 97 <= main__x) && main__x < 98)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_720) == __return_720) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_720) == __return_720) && main__x <= 52) && main__y <= 52)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_720) == __return_720) && 60 <= main__x)) || ((((74 <= main__y && main__x <= 74) && 74 <= main__x) && \old(__return_720) == __return_720) && main__y <= 74)) || ((((main__y <= 98 && 98 <= main__y) && 98 <= main__x) && main__x < 99) && \old(__return_720) == __return_720)) || ((((63 <= main__y && 63 <= main__x) && \old(__return_720) == __return_720) && main__x <= 63) && main__y <= 63)) || ((((main__y <= 84 && main__x <= 84) && 84 <= main__x) && 84 <= main__y) && \old(__return_720) == __return_720)) || (((main__y <= 50 && 50 <= main__y) && main__x <= 50) && \old(__return_720) == __return_720)) || ((((87 <= main__x && 87 <= main__y) && main__y <= 87) && \old(__return_720) == __return_720) && main__x <= 87)) || ((((main__y <= 78 && 78 <= main__x) && 78 <= main__y) && \old(__return_720) == __return_720) && main__x <= 78)) || ((((main__y <= 79 && main__x <= 79) && \old(__return_720) == __return_720) && 79 <= main__x) && 79 <= main__y)) || ((((81 <= main__x && main__y <= 81) && 81 <= main__y) && \old(__return_720) == __return_720) && main__x <= 81)) || ((((main__x <= 58 && main__y <= 58) && \old(__return_720) == __return_720) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 68 && main__x <= 68) && 68 <= main__y) && 68 <= main__x) && \old(__return_720) == __return_720)) || ((((93 <= main__y && \old(__return_720) == __return_720) && 93 <= main__x) && main__x <= 93) && main__y <= 93)) || ((((94 <= main__y && main__x <= 94) && main__y <= 94) && \old(__return_720) == __return_720) && 94 <= main__x)) || ((((main__x <= 54 && \old(__return_720) == __return_720) && 54 <= main__y) && main__y <= 54) && 54 <= main__x) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_720) == __return_720) && main__x <= 1 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 8) && \old(__return_720) == __return_720 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 2) && \old(__return_720) == __return_720 RESULT: Ultimate proved your program to be correct! [2022-04-05 05:26:05,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...