/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 12:13:17,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 12:13:17,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 12:13:17,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 12:13:17,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 12:13:17,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 12:13:17,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 12:13:17,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 12:13:17,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 12:13:17,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 12:13:17,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 12:13:17,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 12:13:17,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 12:13:17,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 12:13:17,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 12:13:17,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 12:13:17,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 12:13:17,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 12:13:17,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 12:13:17,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 12:13:17,582 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 12:13:17,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 12:13:17,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 12:13:17,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 12:13:17,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 12:13:17,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 12:13:17,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 12:13:17,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 12:13:17,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 12:13:17,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 12:13:17,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 12:13:17,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 12:13:17,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 12:13:17,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 12:13:17,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 12:13:17,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 12:13:17,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 12:13:17,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 12:13:17,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 12:13:17,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 12:13:17,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 12:13:17,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 12:13:17,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-18 12:13:17,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 12:13:17,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 12:13:17,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 12:13:17,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 12:13:17,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 12:13:17,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 12:13:17,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 12:13:17,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 12:13:17,620 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 12:13:17,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 12:13:17,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 12:13:17,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 12:13:17,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 12:13:17,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 12:13:17,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 12:13:17,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 12:13:17,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 12:13:17,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 12:13:17,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 12:13:17,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 12:13:17,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 12:13:17,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 12:13:17,624 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 12:13:17,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 12:13:17,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 12:13:17,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-03-18 12:13:17,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 12:13:17,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 12:13:17,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 12:13:17,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 12:13:17,798 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 12:13:17,799 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+nlh-reducer.c [2022-03-18 12:13:17,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca7ae587/266928e942ee401ba5186dffdf6ae12b/FLAG8d9ab60b0 [2022-03-18 12:13:18,199 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 12:13:18,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2022-03-18 12:13:18,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca7ae587/266928e942ee401ba5186dffdf6ae12b/FLAG8d9ab60b0 [2022-03-18 12:13:18,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca7ae587/266928e942ee401ba5186dffdf6ae12b [2022-03-18 12:13:18,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 12:13:18,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 12:13:18,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 12:13:18,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 12:13:18,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 12:13:18,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f5a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18, skipping insertion in model container [2022-03-18 12:13:18,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 12:13:18,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 12:13:18,434 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+nlh-reducer.c[6448,6461] [2022-03-18 12:13:18,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 12:13:18,474 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 12:13:18,500 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+nlh-reducer.c[6448,6461] [2022-03-18 12:13:18,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 12:13:18,529 INFO L208 MainTranslator]: Completed translation [2022-03-18 12:13:18,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18 WrapperNode [2022-03-18 12:13:18,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 12:13:18,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 12:13:18,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 12:13:18,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 12:13:18,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 12:13:18,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 12:13:18,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 12:13:18,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 12:13:18,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (1/1) ... [2022-03-18 12:13:18,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 12:13:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:13:18,609 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-03-18 12:13:18,611 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-03-18 12:13:18,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 12:13:18,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 12:13:18,647 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 12:13:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-18 12:13:18,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-18 12:13:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 12:13:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 12:13:18,701 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 12:13:18,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 12:13:19,128 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 12:13:19,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 12:13:19,133 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-18 12:13:19,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:13:19 BoogieIcfgContainer [2022-03-18 12:13:19,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 12:13:19,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 12:13:19,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 12:13:19,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 12:13:19,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 12:13:18" (1/3) ... [2022-03-18 12:13:19,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70de5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:13:19, skipping insertion in model container [2022-03-18 12:13:19,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:13:18" (2/3) ... [2022-03-18 12:13:19,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70de5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:13:19, skipping insertion in model container [2022-03-18 12:13:19,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:13:19" (3/3) ... [2022-03-18 12:13:19,140 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2022-03-18 12:13:19,143 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 12:13:19,143 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 12:13:19,169 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 12:13:19,173 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 12:13:19,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 12:13:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 143 states have (on average 1.965034965034965) internal successors, (281), 144 states have internal predecessors, (281), 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-03-18 12:13:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:19,236 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:19,237 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:19,237 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -226504135, now seen corresponding path program 1 times [2022-03-18 12:13:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:19,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907649857] [2022-03-18 12:13:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907649857] [2022-03-18 12:13:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907649857] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:19,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:19,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 12:13:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109133509] [2022-03-18 12:13:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:19,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 12:13:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 12:13:19,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-18 12:13:19,486 INFO L87 Difference]: Start difference. First operand has 149 states, 143 states have (on average 1.965034965034965) internal successors, (281), 144 states have internal predecessors, (281), 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 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 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-03-18 12:13:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:19,916 INFO L93 Difference]: Finished difference Result 292 states and 562 transitions. [2022-03-18 12:13:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 12:13:19,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:19,923 INFO L225 Difference]: With dead ends: 292 [2022-03-18 12:13:19,923 INFO L226 Difference]: Without dead ends: 145 [2022-03-18 12:13:19,925 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-18 12:13:19,927 INFO L912 BasicCegarLoop]: 211 mSDtfsCounter, 271 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:19,928 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 226 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-18 12:13:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-03-18 12:13:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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-03-18 12:13:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2022-03-18 12:13:19,956 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 143 [2022-03-18 12:13:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:19,957 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2022-03-18 12:13:19,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 4 states have internal predecessors, (140), 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-03-18 12:13:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2022-03-18 12:13:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:19,960 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:19,960 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:19,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 12:13:19,960 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1788930742, now seen corresponding path program 1 times [2022-03-18 12:13:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354712483] [2022-03-18 12:13:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:20,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354712483] [2022-03-18 12:13:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354712483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:20,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 12:13:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152045156] [2022-03-18 12:13:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:20,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 12:13:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 12:13:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 12:13:20,031 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-03-18 12:13:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:20,437 INFO L93 Difference]: Finished difference Result 406 states and 602 transitions. [2022-03-18 12:13:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 12:13:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:20,439 INFO L225 Difference]: With dead ends: 406 [2022-03-18 12:13:20,439 INFO L226 Difference]: Without dead ends: 275 [2022-03-18 12:13:20,440 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-18 12:13:20,440 INFO L912 BasicCegarLoop]: 80 mSDtfsCounter, 339 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:20,441 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 87 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-03-18 12:13:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-03-18 12:13:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 271 states have (on average 1.2509225092250922) internal successors, (339), 271 states have internal predecessors, (339), 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-03-18 12:13:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 342 transitions. [2022-03-18 12:13:20,465 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 342 transitions. Word has length 143 [2022-03-18 12:13:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:20,468 INFO L478 AbstractCegarLoop]: Abstraction has 275 states and 342 transitions. [2022-03-18 12:13:20,470 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-03-18 12:13:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 342 transitions. [2022-03-18 12:13:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:20,479 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:20,479 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:20,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 12:13:20,479 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash 245018630, now seen corresponding path program 1 times [2022-03-18 12:13:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:20,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340511665] [2022-03-18 12:13:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:20,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340511665] [2022-03-18 12:13:20,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340511665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:20,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:20,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 12:13:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896331487] [2022-03-18 12:13:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:20,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 12:13:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 12:13:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-18 12:13:20,621 INFO L87 Difference]: Start difference. First operand 275 states and 342 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 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-03-18 12:13:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:20,890 INFO L93 Difference]: Finished difference Result 406 states and 473 transitions. [2022-03-18 12:13:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 12:13:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:20,891 INFO L225 Difference]: With dead ends: 406 [2022-03-18 12:13:20,891 INFO L226 Difference]: Without dead ends: 273 [2022-03-18 12:13:20,892 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-03-18 12:13:20,893 INFO L912 BasicCegarLoop]: 204 mSDtfsCounter, 204 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:20,893 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 216 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 12:13:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-03-18 12:13:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-03-18 12:13:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.2490706319702602) internal successors, (336), 269 states have internal predecessors, (336), 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-03-18 12:13:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 339 transitions. [2022-03-18 12:13:20,908 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 339 transitions. Word has length 143 [2022-03-18 12:13:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:20,908 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 339 transitions. [2022-03-18 12:13:20,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 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-03-18 12:13:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 339 transitions. [2022-03-18 12:13:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:20,909 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:20,909 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:20,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 12:13:20,910 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1669664994, now seen corresponding path program 1 times [2022-03-18 12:13:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819992598] [2022-03-18 12:13:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:20,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819992598] [2022-03-18 12:13:20,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819992598] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:20,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:20,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 12:13:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985401611] [2022-03-18 12:13:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:20,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 12:13:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 12:13:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-18 12:13:20,987 INFO L87 Difference]: Start difference. First operand 273 states and 339 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 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-03-18 12:13:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:21,328 INFO L93 Difference]: Finished difference Result 400 states and 466 transitions. [2022-03-18 12:13:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 12:13:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:21,329 INFO L225 Difference]: With dead ends: 400 [2022-03-18 12:13:21,329 INFO L226 Difference]: Without dead ends: 269 [2022-03-18 12:13:21,330 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-03-18 12:13:21,331 INFO L912 BasicCegarLoop]: 198 mSDtfsCounter, 203 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:21,331 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 215 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-03-18 12:13:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-03-18 12:13:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 265 states have (on average 1.2452830188679245) internal successors, (330), 265 states have internal predecessors, (330), 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-03-18 12:13:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2022-03-18 12:13:21,341 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2022-03-18 12:13:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:21,342 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2022-03-18 12:13:21,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 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-03-18 12:13:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2022-03-18 12:13:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:21,343 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:21,343 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:21,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 12:13:21,343 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1509197206, now seen corresponding path program 1 times [2022-03-18 12:13:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693211415] [2022-03-18 12:13:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:21,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693211415] [2022-03-18 12:13:21,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693211415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:21,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:21,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-18 12:13:21,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376211568] [2022-03-18 12:13:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:21,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 12:13:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 12:13:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-03-18 12:13:21,424 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 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-03-18 12:13:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:21,835 INFO L93 Difference]: Finished difference Result 392 states and 456 transitions. [2022-03-18 12:13:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 12:13:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:21,837 INFO L225 Difference]: With dead ends: 392 [2022-03-18 12:13:21,837 INFO L226 Difference]: Without dead ends: 265 [2022-03-18 12:13:21,837 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-03-18 12:13:21,838 INFO L912 BasicCegarLoop]: 192 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:21,839 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 214 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-03-18 12:13:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-03-18 12:13:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 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-03-18 12:13:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2022-03-18 12:13:21,847 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2022-03-18 12:13:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:21,847 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2022-03-18 12:13:21,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 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-03-18 12:13:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2022-03-18 12:13:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:21,849 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:21,849 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:21,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-18 12:13:21,849 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1430239655, now seen corresponding path program 1 times [2022-03-18 12:13:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:21,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514373519] [2022-03-18 12:13:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514373519] [2022-03-18 12:13:21,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514373519] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:21,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:21,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-18 12:13:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535334462] [2022-03-18 12:13:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:21,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 12:13:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 12:13:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-03-18 12:13:21,947 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 12 states have internal predecessors, (140), 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-03-18 12:13:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:22,241 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2022-03-18 12:13:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 12:13:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 12 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:22,249 INFO L225 Difference]: With dead ends: 382 [2022-03-18 12:13:22,249 INFO L226 Difference]: Without dead ends: 259 [2022-03-18 12:13:22,250 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-03-18 12:13:22,253 INFO L912 BasicCegarLoop]: 183 mSDtfsCounter, 213 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:22,258 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 190 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 12:13:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-18 12:13:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-03-18 12:13:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.2352941176470589) internal successors, (315), 255 states have internal predecessors, (315), 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-03-18 12:13:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2022-03-18 12:13:22,269 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2022-03-18 12:13:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:22,270 INFO L478 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2022-03-18 12:13:22,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 12 states have internal predecessors, (140), 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-03-18 12:13:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2022-03-18 12:13:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:22,287 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:22,287 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:22,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-18 12:13:22,287 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1823886761, now seen corresponding path program 1 times [2022-03-18 12:13:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082486553] [2022-03-18 12:13:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:22,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082486553] [2022-03-18 12:13:22,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082486553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:22,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:22,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-18 12:13:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173500333] [2022-03-18 12:13:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:22,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-18 12:13:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-18 12:13:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2022-03-18 12:13:22,446 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 14 states have internal predecessors, (140), 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-03-18 12:13:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:22,902 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2022-03-18 12:13:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-18 12:13:22,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 14 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:22,904 INFO L225 Difference]: With dead ends: 372 [2022-03-18 12:13:22,904 INFO L226 Difference]: Without dead ends: 255 [2022-03-18 12:13:22,905 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2022-03-18 12:13:22,905 INFO L912 BasicCegarLoop]: 177 mSDtfsCounter, 207 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:22,905 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 199 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-03-18 12:13:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-03-18 12:13:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.2310756972111554) internal successors, (309), 251 states have internal predecessors, (309), 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-03-18 12:13:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2022-03-18 12:13:22,914 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2022-03-18 12:13:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:22,914 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2022-03-18 12:13:22,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 14 states have internal predecessors, (140), 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-03-18 12:13:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2022-03-18 12:13:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:22,918 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:22,918 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:22,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-18 12:13:22,919 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1370409666, now seen corresponding path program 1 times [2022-03-18 12:13:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:22,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377424728] [2022-03-18 12:13:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:23,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377424728] [2022-03-18 12:13:23,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377424728] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:23,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-18 12:13:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580113294] [2022-03-18 12:13:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:23,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-18 12:13:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-18 12:13:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-03-18 12:13:23,067 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand has 16 states, 16 states have (on average 8.75) internal successors, (140), 15 states have internal predecessors, (140), 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-03-18 12:13:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:23,516 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2022-03-18 12:13:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-18 12:13:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 15 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:23,519 INFO L225 Difference]: With dead ends: 366 [2022-03-18 12:13:23,519 INFO L226 Difference]: Without dead ends: 253 [2022-03-18 12:13:23,519 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2022-03-18 12:13:23,520 INFO L912 BasicCegarLoop]: 174 mSDtfsCounter, 208 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:23,520 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 191 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-03-18 12:13:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-03-18 12:13:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 249 states have (on average 1.2289156626506024) internal successors, (306), 249 states have internal predecessors, (306), 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-03-18 12:13:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2022-03-18 12:13:23,533 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2022-03-18 12:13:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:23,534 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2022-03-18 12:13:23,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 15 states have internal predecessors, (140), 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-03-18 12:13:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2022-03-18 12:13:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:23,535 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:23,536 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:23,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-18 12:13:23,536 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1524671279, now seen corresponding path program 1 times [2022-03-18 12:13:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:23,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546883273] [2022-03-18 12:13:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:23,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546883273] [2022-03-18 12:13:23,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546883273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:23,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:23,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-18 12:13:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711926798] [2022-03-18 12:13:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:23,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 12:13:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:23,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 12:13:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2022-03-18 12:13:23,736 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 16 states have internal predecessors, (140), 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-03-18 12:13:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:24,217 INFO L93 Difference]: Finished difference Result 362 states and 418 transitions. [2022-03-18 12:13:24,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 12:13:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 16 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:24,218 INFO L225 Difference]: With dead ends: 362 [2022-03-18 12:13:24,218 INFO L226 Difference]: Without dead ends: 251 [2022-03-18 12:13:24,219 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2022-03-18 12:13:24,220 INFO L912 BasicCegarLoop]: 171 mSDtfsCounter, 208 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:24,220 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 183 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-03-18 12:13:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-03-18 12:13:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 247 states have internal predecessors, (303), 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-03-18 12:13:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2022-03-18 12:13:24,228 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 143 [2022-03-18 12:13:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:24,228 INFO L478 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2022-03-18 12:13:24,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 16 states have internal predecessors, (140), 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-03-18 12:13:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2022-03-18 12:13:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:24,229 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:24,229 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:24,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-18 12:13:24,229 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 512357033, now seen corresponding path program 1 times [2022-03-18 12:13:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:24,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95842201] [2022-03-18 12:13:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:24,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95842201] [2022-03-18 12:13:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95842201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:24,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-18 12:13:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450002850] [2022-03-18 12:13:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:24,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-18 12:13:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-18 12:13:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2022-03-18 12:13:24,402 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 20 states have internal predecessors, (140), 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-03-18 12:13:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:25,044 INFO L93 Difference]: Finished difference Result 352 states and 407 transitions. [2022-03-18 12:13:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-18 12:13:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 20 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:25,046 INFO L225 Difference]: With dead ends: 352 [2022-03-18 12:13:25,046 INFO L226 Difference]: Without dead ends: 243 [2022-03-18 12:13:25,046 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2022-03-18 12:13:25,047 INFO L912 BasicCegarLoop]: 159 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:25,047 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 186 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-03-18 12:13:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-03-18 12:13:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 239 states have (on average 1.217573221757322) internal successors, (291), 239 states have internal predecessors, (291), 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-03-18 12:13:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 294 transitions. [2022-03-18 12:13:25,054 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 294 transitions. Word has length 143 [2022-03-18 12:13:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:25,054 INFO L478 AbstractCegarLoop]: Abstraction has 243 states and 294 transitions. [2022-03-18 12:13:25,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 20 states have internal predecessors, (140), 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-03-18 12:13:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 294 transitions. [2022-03-18 12:13:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:25,055 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:25,055 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:25,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-18 12:13:25,055 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1151655290, now seen corresponding path program 1 times [2022-03-18 12:13:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837973956] [2022-03-18 12:13:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837973956] [2022-03-18 12:13:25,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837973956] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:25,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:25,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-18 12:13:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109433528] [2022-03-18 12:13:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:25,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-18 12:13:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-18 12:13:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-03-18 12:13:25,254 INFO L87 Difference]: Start difference. First operand 243 states and 294 transitions. Second operand has 22 states, 22 states have (on average 6.363636363636363) internal successors, (140), 21 states have internal predecessors, (140), 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-03-18 12:13:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:25,820 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2022-03-18 12:13:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-18 12:13:25,820 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.363636363636363) internal successors, (140), 21 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:25,821 INFO L225 Difference]: With dead ends: 342 [2022-03-18 12:13:25,821 INFO L226 Difference]: Without dead ends: 241 [2022-03-18 12:13:25,822 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2022-03-18 12:13:25,823 INFO L912 BasicCegarLoop]: 156 mSDtfsCounter, 217 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:25,823 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 178 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-03-18 12:13:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-03-18 12:13:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 237 states have (on average 1.2151898734177216) internal successors, (288), 237 states have internal predecessors, (288), 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-03-18 12:13:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 291 transitions. [2022-03-18 12:13:25,830 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 291 transitions. Word has length 143 [2022-03-18 12:13:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:25,830 INFO L478 AbstractCegarLoop]: Abstraction has 241 states and 291 transitions. [2022-03-18 12:13:25,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.363636363636363) internal successors, (140), 21 states have internal predecessors, (140), 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-03-18 12:13:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 291 transitions. [2022-03-18 12:13:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:25,831 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:25,831 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:25,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-18 12:13:25,831 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2019048926, now seen corresponding path program 1 times [2022-03-18 12:13:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915204954] [2022-03-18 12:13:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:26,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:26,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915204954] [2022-03-18 12:13:26,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915204954] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:26,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:26,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-18 12:13:26,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893604671] [2022-03-18 12:13:26,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:26,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-18 12:13:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-18 12:13:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-03-18 12:13:26,055 INFO L87 Difference]: Start difference. First operand 241 states and 291 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 23 states have internal predecessors, (140), 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-03-18 12:13:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:26,727 INFO L93 Difference]: Finished difference Result 336 states and 386 transitions. [2022-03-18 12:13:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-18 12:13:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 23 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:26,728 INFO L225 Difference]: With dead ends: 336 [2022-03-18 12:13:26,729 INFO L226 Difference]: Without dead ends: 237 [2022-03-18 12:13:26,729 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2022-03-18 12:13:26,730 INFO L912 BasicCegarLoop]: 150 mSDtfsCounter, 221 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:26,730 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 177 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-18 12:13:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-03-18 12:13:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.2103004291845494) internal successors, (282), 233 states have internal predecessors, (282), 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-03-18 12:13:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2022-03-18 12:13:26,737 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2022-03-18 12:13:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:26,737 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2022-03-18 12:13:26,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 23 states have internal predecessors, (140), 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-03-18 12:13:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2022-03-18 12:13:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:26,738 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:26,738 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:26,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-18 12:13:26,738 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:26,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -642501226, now seen corresponding path program 1 times [2022-03-18 12:13:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:26,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289267590] [2022-03-18 12:13:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289267590] [2022-03-18 12:13:26,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289267590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:26,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:26,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-18 12:13:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807759693] [2022-03-18 12:13:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:26,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-18 12:13:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-18 12:13:26,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-03-18 12:13:26,978 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 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-03-18 12:13:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:27,499 INFO L93 Difference]: Finished difference Result 328 states and 376 transitions. [2022-03-18 12:13:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-18 12:13:27,499 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:27,501 INFO L225 Difference]: With dead ends: 328 [2022-03-18 12:13:27,501 INFO L226 Difference]: Without dead ends: 233 [2022-03-18 12:13:27,502 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2022-03-18 12:13:27,503 INFO L912 BasicCegarLoop]: 144 mSDtfsCounter, 241 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:27,503 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 151 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 12:13:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-03-18 12:13:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-03-18 12:13:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.205240174672489) internal successors, (276), 229 states have internal predecessors, (276), 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-03-18 12:13:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2022-03-18 12:13:27,512 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2022-03-18 12:13:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:27,512 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2022-03-18 12:13:27,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 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-03-18 12:13:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2022-03-18 12:13:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:27,513 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:27,513 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:27,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-18 12:13:27,513 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1746101127, now seen corresponding path program 1 times [2022-03-18 12:13:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:27,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670351881] [2022-03-18 12:13:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:27,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670351881] [2022-03-18 12:13:27,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670351881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:27,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:27,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-18 12:13:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555513363] [2022-03-18 12:13:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:27,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-18 12:13:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-18 12:13:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2022-03-18 12:13:27,844 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 28 states have internal predecessors, (140), 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-03-18 12:13:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:28,451 INFO L93 Difference]: Finished difference Result 318 states and 364 transitions. [2022-03-18 12:13:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-18 12:13:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 28 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:28,452 INFO L225 Difference]: With dead ends: 318 [2022-03-18 12:13:28,452 INFO L226 Difference]: Without dead ends: 227 [2022-03-18 12:13:28,453 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2022-03-18 12:13:28,454 INFO L912 BasicCegarLoop]: 135 mSDtfsCounter, 253 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:28,454 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 142 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 12:13:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-03-18 12:13:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-03-18 12:13:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 223 states have (on average 1.1973094170403586) internal successors, (267), 223 states have internal predecessors, (267), 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-03-18 12:13:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2022-03-18 12:13:28,460 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2022-03-18 12:13:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:28,460 INFO L478 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2022-03-18 12:13:28,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 28 states have internal predecessors, (140), 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-03-18 12:13:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2022-03-18 12:13:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:28,462 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:28,462 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:28,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-18 12:13:28,462 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash 297304713, now seen corresponding path program 1 times [2022-03-18 12:13:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:28,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490279800] [2022-03-18 12:13:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:28,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490279800] [2022-03-18 12:13:28,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490279800] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:28,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:28,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-03-18 12:13:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982639014] [2022-03-18 12:13:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:28,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-18 12:13:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-18 12:13:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2022-03-18 12:13:28,821 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 30 states have internal predecessors, (140), 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-03-18 12:13:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:29,669 INFO L93 Difference]: Finished difference Result 308 states and 351 transitions. [2022-03-18 12:13:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-18 12:13:29,670 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 30 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:29,671 INFO L225 Difference]: With dead ends: 308 [2022-03-18 12:13:29,671 INFO L226 Difference]: Without dead ends: 223 [2022-03-18 12:13:29,672 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2022-03-18 12:13:29,672 INFO L912 BasicCegarLoop]: 129 mSDtfsCounter, 221 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:29,672 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 161 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-18 12:13:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-03-18 12:13:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 219 states have (on average 1.1917808219178083) internal successors, (261), 219 states have internal predecessors, (261), 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-03-18 12:13:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2022-03-18 12:13:29,679 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2022-03-18 12:13:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:29,680 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2022-03-18 12:13:29,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 30 states have internal predecessors, (140), 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-03-18 12:13:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2022-03-18 12:13:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:29,681 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:29,681 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:29,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-18 12:13:29,681 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2017851138, now seen corresponding path program 1 times [2022-03-18 12:13:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:29,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430977381] [2022-03-18 12:13:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:30,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430977381] [2022-03-18 12:13:30,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430977381] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:30,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:30,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-03-18 12:13:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737668785] [2022-03-18 12:13:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:30,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-18 12:13:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:30,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-18 12:13:30,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-03-18 12:13:30,099 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand has 32 states, 32 states have (on average 4.375) internal successors, (140), 31 states have internal predecessors, (140), 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-03-18 12:13:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:31,309 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2022-03-18 12:13:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-18 12:13:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.375) internal successors, (140), 31 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:31,310 INFO L225 Difference]: With dead ends: 302 [2022-03-18 12:13:31,310 INFO L226 Difference]: Without dead ends: 221 [2022-03-18 12:13:31,312 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2022-03-18 12:13:31,312 INFO L912 BasicCegarLoop]: 126 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:31,312 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 163 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-18 12:13:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-03-18 12:13:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-03-18 12:13:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 217 states have (on average 1.1889400921658986) internal successors, (258), 217 states have internal predecessors, (258), 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-03-18 12:13:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2022-03-18 12:13:31,318 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2022-03-18 12:13:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:31,318 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2022-03-18 12:13:31,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.375) internal successors, (140), 31 states have internal predecessors, (140), 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-03-18 12:13:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2022-03-18 12:13:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:31,319 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:31,319 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:31,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-18 12:13:31,319 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1981140879, now seen corresponding path program 1 times [2022-03-18 12:13:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343411895] [2022-03-18 12:13:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:31,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343411895] [2022-03-18 12:13:31,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343411895] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:31,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:31,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-03-18 12:13:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592501767] [2022-03-18 12:13:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:31,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-18 12:13:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-18 12:13:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2022-03-18 12:13:31,806 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 32 states have internal predecessors, (140), 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-03-18 12:13:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:32,775 INFO L93 Difference]: Finished difference Result 298 states and 338 transitions. [2022-03-18 12:13:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-18 12:13:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 32 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:32,776 INFO L225 Difference]: With dead ends: 298 [2022-03-18 12:13:32,776 INFO L226 Difference]: Without dead ends: 219 [2022-03-18 12:13:32,778 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2022-03-18 12:13:32,778 INFO L912 BasicCegarLoop]: 123 mSDtfsCounter, 237 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:32,778 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 145 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-18 12:13:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-03-18 12:13:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 215 states have (on average 1.186046511627907) internal successors, (255), 215 states have internal predecessors, (255), 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-03-18 12:13:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2022-03-18 12:13:32,784 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 143 [2022-03-18 12:13:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:32,784 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2022-03-18 12:13:32,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 32 states have internal predecessors, (140), 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-03-18 12:13:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-03-18 12:13:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:32,785 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:32,785 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:32,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-18 12:13:32,785 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -553761847, now seen corresponding path program 1 times [2022-03-18 12:13:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578970974] [2022-03-18 12:13:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:33,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578970974] [2022-03-18 12:13:33,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578970974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:33,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:33,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-03-18 12:13:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128153212] [2022-03-18 12:13:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:33,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-18 12:13:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-18 12:13:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2022-03-18 12:13:33,279 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 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-03-18 12:13:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:34,211 INFO L93 Difference]: Finished difference Result 288 states and 327 transitions. [2022-03-18 12:13:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-18 12:13:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:34,212 INFO L225 Difference]: With dead ends: 288 [2022-03-18 12:13:34,212 INFO L226 Difference]: Without dead ends: 211 [2022-03-18 12:13:34,214 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2022-03-18 12:13:34,214 INFO L912 BasicCegarLoop]: 111 mSDtfsCounter, 237 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:34,214 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 133 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-03-18 12:13:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-03-18 12:13:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.173913043478261) internal successors, (243), 207 states have internal predecessors, (243), 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-03-18 12:13:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2022-03-18 12:13:34,220 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 143 [2022-03-18 12:13:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:34,220 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2022-03-18 12:13:34,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 36 states have internal predecessors, (140), 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-03-18 12:13:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2022-03-18 12:13:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:34,221 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:34,221 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:34,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-18 12:13:34,221 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1427802886, now seen corresponding path program 1 times [2022-03-18 12:13:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:34,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923656144] [2022-03-18 12:13:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923656144] [2022-03-18 12:13:34,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923656144] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:34,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:34,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-03-18 12:13:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322573517] [2022-03-18 12:13:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:34,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-18 12:13:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-18 12:13:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-03-18 12:13:34,705 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 37 states have internal predecessors, (140), 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-03-18 12:13:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:35,726 INFO L93 Difference]: Finished difference Result 278 states and 313 transitions. [2022-03-18 12:13:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-18 12:13:35,727 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 37 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:35,728 INFO L225 Difference]: With dead ends: 278 [2022-03-18 12:13:35,728 INFO L226 Difference]: Without dead ends: 209 [2022-03-18 12:13:35,729 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2022-03-18 12:13:35,729 INFO L912 BasicCegarLoop]: 108 mSDtfsCounter, 256 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:35,730 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 140 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-03-18 12:13:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-03-18 12:13:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.170731707317073) internal successors, (240), 205 states have internal predecessors, (240), 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-03-18 12:13:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2022-03-18 12:13:35,735 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 143 [2022-03-18 12:13:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:35,735 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2022-03-18 12:13:35,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 37 states have internal predecessors, (140), 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-03-18 12:13:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2022-03-18 12:13:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:35,736 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:35,736 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:35,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-18 12:13:35,736 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1201706654, now seen corresponding path program 1 times [2022-03-18 12:13:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:35,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690703817] [2022-03-18 12:13:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:36,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690703817] [2022-03-18 12:13:36,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690703817] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:36,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:36,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-03-18 12:13:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071612897] [2022-03-18 12:13:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:36,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-18 12:13:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-18 12:13:36,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-03-18 12:13:36,251 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 40 states, 40 states have (on average 3.5) internal successors, (140), 39 states have internal predecessors, (140), 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-03-18 12:13:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:37,248 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2022-03-18 12:13:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-18 12:13:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.5) internal successors, (140), 39 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:37,250 INFO L225 Difference]: With dead ends: 272 [2022-03-18 12:13:37,250 INFO L226 Difference]: Without dead ends: 205 [2022-03-18 12:13:37,251 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2022-03-18 12:13:37,252 INFO L912 BasicCegarLoop]: 102 mSDtfsCounter, 282 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:37,252 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 124 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-03-18 12:13:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-03-18 12:13:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.164179104477612) internal successors, (234), 201 states have internal predecessors, (234), 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-03-18 12:13:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2022-03-18 12:13:37,257 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2022-03-18 12:13:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:37,257 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2022-03-18 12:13:37,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.5) internal successors, (140), 39 states have internal predecessors, (140), 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-03-18 12:13:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2022-03-18 12:13:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:37,258 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:37,258 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:37,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-18 12:13:37,258 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1310645142, now seen corresponding path program 1 times [2022-03-18 12:13:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:37,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996923559] [2022-03-18 12:13:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:37,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996923559] [2022-03-18 12:13:37,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996923559] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:37,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:37,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-03-18 12:13:37,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673884711] [2022-03-18 12:13:37,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:37,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-18 12:13:37,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:37,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-18 12:13:37,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-03-18 12:13:37,895 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand has 42 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 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-03-18 12:13:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:39,122 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2022-03-18 12:13:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-18 12:13:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:39,124 INFO L225 Difference]: With dead ends: 264 [2022-03-18 12:13:39,124 INFO L226 Difference]: Without dead ends: 201 [2022-03-18 12:13:39,126 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2022-03-18 12:13:39,127 INFO L912 BasicCegarLoop]: 96 mSDtfsCounter, 250 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:39,127 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 133 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-03-18 12:13:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-03-18 12:13:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.1573604060913705) internal successors, (228), 197 states have internal predecessors, (228), 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-03-18 12:13:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2022-03-18 12:13:39,132 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2022-03-18 12:13:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:39,133 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2022-03-18 12:13:39,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 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-03-18 12:13:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-03-18 12:13:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:39,133 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:39,134 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:39,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-18 12:13:39,134 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -573249383, now seen corresponding path program 1 times [2022-03-18 12:13:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562176692] [2022-03-18 12:13:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:39,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562176692] [2022-03-18 12:13:39,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562176692] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:39,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:39,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-03-18 12:13:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967400662] [2022-03-18 12:13:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:39,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-18 12:13:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:39,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-18 12:13:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2022-03-18 12:13:39,812 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand has 45 states, 45 states have (on average 3.111111111111111) internal successors, (140), 44 states have internal predecessors, (140), 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-03-18 12:13:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:41,073 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2022-03-18 12:13:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-18 12:13:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.111111111111111) internal successors, (140), 44 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:41,075 INFO L225 Difference]: With dead ends: 254 [2022-03-18 12:13:41,075 INFO L226 Difference]: Without dead ends: 195 [2022-03-18 12:13:41,077 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2022-03-18 12:13:41,077 INFO L912 BasicCegarLoop]: 87 mSDtfsCounter, 312 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:41,077 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 109 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-03-18 12:13:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-03-18 12:13:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.1465968586387434) internal successors, (219), 191 states have internal predecessors, (219), 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-03-18 12:13:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2022-03-18 12:13:41,082 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2022-03-18 12:13:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:41,082 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2022-03-18 12:13:41,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.111111111111111) internal successors, (140), 44 states have internal predecessors, (140), 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-03-18 12:13:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2022-03-18 12:13:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:41,083 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:41,083 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:41,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-18 12:13:41,084 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash 214740329, now seen corresponding path program 1 times [2022-03-18 12:13:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681095975] [2022-03-18 12:13:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681095975] [2022-03-18 12:13:41,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681095975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:41,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:41,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-03-18 12:13:41,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136150709] [2022-03-18 12:13:41,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:41,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-18 12:13:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-18 12:13:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2022-03-18 12:13:41,782 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 47 states, 47 states have (on average 2.978723404255319) internal successors, (140), 46 states have internal predecessors, (140), 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-03-18 12:13:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:43,078 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2022-03-18 12:13:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-18 12:13:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.978723404255319) internal successors, (140), 46 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:43,080 INFO L225 Difference]: With dead ends: 244 [2022-03-18 12:13:43,080 INFO L226 Difference]: Without dead ends: 191 [2022-03-18 12:13:43,082 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2022-03-18 12:13:43,082 INFO L912 BasicCegarLoop]: 81 mSDtfsCounter, 264 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:43,083 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 103 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-18 12:13:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-03-18 12:13:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 187 states have (on average 1.13903743315508) internal successors, (213), 187 states have internal predecessors, (213), 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-03-18 12:13:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-03-18 12:13:43,101 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2022-03-18 12:13:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:43,102 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-03-18 12:13:43,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.978723404255319) internal successors, (140), 46 states have internal predecessors, (140), 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-03-18 12:13:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-03-18 12:13:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:43,103 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:43,103 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:43,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-18 12:13:43,103 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -20309694, now seen corresponding path program 1 times [2022-03-18 12:13:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:43,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030726136] [2022-03-18 12:13:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:44,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:44,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030726136] [2022-03-18 12:13:44,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030726136] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:44,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:44,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-03-18 12:13:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681263756] [2022-03-18 12:13:44,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:44,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-18 12:13:44,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-18 12:13:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-03-18 12:13:44,041 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 47 states have internal predecessors, (140), 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-03-18 12:13:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:45,335 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2022-03-18 12:13:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-18 12:13:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 47 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:45,336 INFO L225 Difference]: With dead ends: 238 [2022-03-18 12:13:45,336 INFO L226 Difference]: Without dead ends: 189 [2022-03-18 12:13:45,338 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2022-03-18 12:13:45,338 INFO L912 BasicCegarLoop]: 78 mSDtfsCounter, 263 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:45,338 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 105 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-18 12:13:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-03-18 12:13:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.135135135135135) internal successors, (210), 185 states have internal predecessors, (210), 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-03-18 12:13:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2022-03-18 12:13:45,343 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2022-03-18 12:13:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:45,343 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2022-03-18 12:13:45,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.9166666666666665) internal successors, (140), 47 states have internal predecessors, (140), 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-03-18 12:13:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2022-03-18 12:13:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:45,344 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:45,344 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:45,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-18 12:13:45,344 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash 178059793, now seen corresponding path program 1 times [2022-03-18 12:13:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:45,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105624933] [2022-03-18 12:13:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105624933] [2022-03-18 12:13:46,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105624933] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-03-18 12:13:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631367466] [2022-03-18 12:13:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:46,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-18 12:13:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-18 12:13:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2022-03-18 12:13:46,118 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 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-03-18 12:13:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:47,535 INFO L93 Difference]: Finished difference Result 234 states and 258 transitions. [2022-03-18 12:13:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-18 12:13:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:47,536 INFO L225 Difference]: With dead ends: 234 [2022-03-18 12:13:47,536 INFO L226 Difference]: Without dead ends: 187 [2022-03-18 12:13:47,537 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2022-03-18 12:13:47,538 INFO L912 BasicCegarLoop]: 75 mSDtfsCounter, 243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:47,538 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 112 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:13:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-03-18 12:13:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-03-18 12:13:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 183 states have (on average 1.1311475409836065) internal successors, (207), 183 states have internal predecessors, (207), 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-03-18 12:13:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-03-18 12:13:47,543 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 143 [2022-03-18 12:13:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:47,543 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-03-18 12:13:47,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.857142857142857) internal successors, (140), 48 states have internal predecessors, (140), 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-03-18 12:13:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-03-18 12:13:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:47,544 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:47,544 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:47,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-18 12:13:47,544 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1601795351, now seen corresponding path program 1 times [2022-03-18 12:13:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:47,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950308846] [2022-03-18 12:13:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:47,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950308846] [2022-03-18 12:13:48,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950308846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:48,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:48,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-03-18 12:13:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645000111] [2022-03-18 12:13:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:48,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-18 12:13:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-18 12:13:48,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-03-18 12:13:48,427 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 53 states, 53 states have (on average 2.641509433962264) internal successors, (140), 52 states have internal predecessors, (140), 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-03-18 12:13:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:49,951 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2022-03-18 12:13:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-18 12:13:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.641509433962264) internal successors, (140), 52 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:49,952 INFO L225 Difference]: With dead ends: 224 [2022-03-18 12:13:49,952 INFO L226 Difference]: Without dead ends: 179 [2022-03-18 12:13:49,953 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2022-03-18 12:13:49,954 INFO L912 BasicCegarLoop]: 63 mSDtfsCounter, 264 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:49,954 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 90 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:13:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-18 12:13:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-03-18 12:13:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 175 states have (on average 1.1142857142857143) internal successors, (195), 175 states have internal predecessors, (195), 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-03-18 12:13:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 198 transitions. [2022-03-18 12:13:49,959 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 198 transitions. Word has length 143 [2022-03-18 12:13:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:49,960 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 198 transitions. [2022-03-18 12:13:49,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.641509433962264) internal successors, (140), 52 states have internal predecessors, (140), 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-03-18 12:13:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 198 transitions. [2022-03-18 12:13:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-18 12:13:49,960 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:49,960 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:49,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-18 12:13:49,961 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -964105850, now seen corresponding path program 1 times [2022-03-18 12:13:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:49,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871263566] [2022-03-18 12:13:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871263566] [2022-03-18 12:13:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871263566] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:13:51,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:13:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-03-18 12:13:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304512474] [2022-03-18 12:13:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:13:51,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-18 12:13:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-18 12:13:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2022-03-18 12:13:51,543 INFO L87 Difference]: Start difference. First operand 179 states and 198 transitions. Second operand has 71 states, 71 states have (on average 1.971830985915493) internal successors, (140), 70 states have internal predecessors, (140), 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-03-18 12:13:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:13:54,579 INFO L93 Difference]: Finished difference Result 456 states and 491 transitions. [2022-03-18 12:13:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-18 12:13:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.971830985915493) internal successors, (140), 70 states have internal predecessors, (140), 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 143 [2022-03-18 12:13:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:13:54,582 INFO L225 Difference]: With dead ends: 456 [2022-03-18 12:13:54,582 INFO L226 Difference]: Without dead ends: 453 [2022-03-18 12:13:54,583 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2022-03-18 12:13:54,584 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 552 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-18 12:13:54,584 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 26 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-18 12:13:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-03-18 12:13:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2022-03-18 12:13:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 448 states have (on average 1.0424107142857142) internal successors, (467), 448 states have internal predecessors, (467), 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-03-18 12:13:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2022-03-18 12:13:54,601 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2022-03-18 12:13:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:13:54,601 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2022-03-18 12:13:54,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.971830985915493) internal successors, (140), 70 states have internal predecessors, (140), 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-03-18 12:13:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2022-03-18 12:13:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-18 12:13:54,603 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:13:54,603 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:13:54,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-18 12:13:54,603 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:13:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:13:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1199688896, now seen corresponding path program 1 times [2022-03-18 12:13:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:13:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222440643] [2022-03-18 12:13:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:13:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:13:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:13:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222440643] [2022-03-18 12:13:56,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222440643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:13:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076701606] [2022-03-18 12:13:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:13:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:13:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:13:56,224 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-03-18 12:13:56,225 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-03-18 12:13:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:13:56,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-18 12:13:56,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:13:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:56,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:13:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:13:58,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076701606] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:13:58,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:13:58,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71, 71] total 104 [2022-03-18 12:13:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087348290] [2022-03-18 12:13:58,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:13:58,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-18 12:13:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:13:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-18 12:13:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-03-18 12:13:58,760 INFO L87 Difference]: Start difference. First operand 452 states and 470 transitions. Second operand has 104 states, 104 states have (on average 2.730769230769231) internal successors, (284), 103 states have internal predecessors, (284), 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-03-18 12:14:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:14:03,938 INFO L93 Difference]: Finished difference Result 519 states and 568 transitions. [2022-03-18 12:14:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-18 12:14:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.730769230769231) internal successors, (284), 103 states have internal predecessors, (284), 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 145 [2022-03-18 12:14:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:14:03,940 INFO L225 Difference]: With dead ends: 519 [2022-03-18 12:14:03,941 INFO L226 Difference]: Without dead ends: 516 [2022-03-18 12:14:03,943 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5780 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2022-03-18 12:14:03,944 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 715 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-18 12:14:03,944 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 31 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-18 12:14:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-18 12:14:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-03-18 12:14:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.037109375) internal successors, (531), 512 states have internal predecessors, (531), 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-03-18 12:14:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 534 transitions. [2022-03-18 12:14:03,962 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 534 transitions. Word has length 145 [2022-03-18 12:14:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:14:03,962 INFO L478 AbstractCegarLoop]: Abstraction has 516 states and 534 transitions. [2022-03-18 12:14:03,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.730769230769231) internal successors, (284), 103 states have internal predecessors, (284), 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-03-18 12:14:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 534 transitions. [2022-03-18 12:14:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-03-18 12:14:03,964 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:14:03,965 INFO L500 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-18 12:14:03,994 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-03-18 12:14:04,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-18 12:14:04,191 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:14:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:14:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 844418048, now seen corresponding path program 2 times [2022-03-18 12:14:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:14:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037189892] [2022-03-18 12:14:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:14:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:14:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:14:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:14:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:14:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:14:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:14:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037189892] [2022-03-18 12:14:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037189892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:14:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723887475] [2022-03-18 12:14:05,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 12:14:05,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:14:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:14:05,933 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-03-18 12:14:05,985 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-03-18 12:14:06,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 12:14:06,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:14:06,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 105 conjunts are in the unsatisfiable core [2022-03-18 12:14:06,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:14:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:14:06,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:14:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:14:07,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723887475] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:14:07,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:14:07,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2022-03-18 12:14:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023308183] [2022-03-18 12:14:07,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:14:07,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-18 12:14:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:14:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-18 12:14:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2022-03-18 12:14:07,380 INFO L87 Difference]: Start difference. First operand 516 states and 534 transitions. Second operand has 56 states, 56 states have (on average 3.732142857142857) internal successors, (209), 55 states have internal predecessors, (209), 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-03-18 12:14:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:14:18,170 INFO L93 Difference]: Finished difference Result 522 states and 540 transitions. [2022-03-18 12:14:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-18 12:14:18,171 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.732142857142857) internal successors, (209), 55 states have internal predecessors, (209), 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-03-18 12:14:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:14:18,172 INFO L225 Difference]: With dead ends: 522 [2022-03-18 12:14:18,172 INFO L226 Difference]: Without dead ends: 519 [2022-03-18 12:14:18,174 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 414 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=321, Invalid=11235, Unknown=0, NotChecked=0, Total=11556 [2022-03-18 12:14:18,178 INFO L912 BasicCegarLoop]: 330 mSDtfsCounter, 502 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 27240 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 27598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 27240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:14:18,178 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 592 Invalid, 27598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 27240 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-03-18 12:14:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-18 12:14:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 518. [2022-03-18 12:14:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 514 states have (on average 1.0369649805447472) internal successors, (533), 514 states have internal predecessors, (533), 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-03-18 12:14:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 536 transitions. [2022-03-18 12:14:18,207 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 536 transitions. Word has length 209 [2022-03-18 12:14:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:14:18,208 INFO L478 AbstractCegarLoop]: Abstraction has 518 states and 536 transitions. [2022-03-18 12:14:18,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.732142857142857) internal successors, (209), 55 states have internal predecessors, (209), 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-03-18 12:14:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 536 transitions. [2022-03-18 12:14:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-03-18 12:14:18,209 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:14:18,209 INFO L500 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-18 12:14:18,245 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-03-18 12:14:18,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-18 12:14:18,441 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:14:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:14:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -270600006, now seen corresponding path program 3 times [2022-03-18 12:14:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:14:18,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983014317] [2022-03-18 12:14:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:14:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:14:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:14:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:14:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:14:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:14:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:14:19,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983014317] [2022-03-18 12:14:19,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983014317] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:14:19,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:14:19,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-03-18 12:14:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112342917] [2022-03-18 12:14:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:14:19,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-18 12:14:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:14:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-18 12:14:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-03-18 12:14:19,165 INFO L87 Difference]: Start difference. First operand 518 states and 536 transitions. Second operand has 53 states, 53 states have (on average 3.9245283018867925) internal successors, (208), 52 states have internal predecessors, (208), 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-03-18 12:14:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:14:20,219 INFO L93 Difference]: Finished difference Result 518 states and 536 transitions. [2022-03-18 12:14:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-18 12:14:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.9245283018867925) internal successors, (208), 52 states have internal predecessors, (208), 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-03-18 12:14:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:14:20,220 INFO L225 Difference]: With dead ends: 518 [2022-03-18 12:14:20,220 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 12:14:20,222 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2022-03-18 12:14:20,223 INFO L912 BasicCegarLoop]: 126 mSDtfsCounter, 498 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:14:20,223 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 148 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:14:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 12:14:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 12:14:20,223 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-03-18 12:14:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 12:14:20,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2022-03-18 12:14:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:14:20,223 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 12:14:20,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.9245283018867925) internal successors, (208), 52 states have internal predecessors, (208), 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-03-18 12:14:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 12:14:20,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 12:14:20,225 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 12:14:20,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-18 12:14:20,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 12:14:21,674 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-18 12:14:21,674 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-18 12:14:21,674 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-18 12:14:21,674 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-03-18 12:14:21,675 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-03-18 12:14:21,675 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-03-18 12:14:21,675 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-03-18 12:14:21,675 INFO L878 garLoopResultBuilder]: At program point L927(lines 181 928) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 28) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,675 INFO L878 garLoopResultBuilder]: At program point L795(lines 247 796) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 39)) [2022-03-18 12:14:21,675 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 1258) no Hoare annotation was computed. [2022-03-18 12:14:21,675 INFO L878 garLoopResultBuilder]: At program point L663(lines 313 664) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 50)) [2022-03-18 12:14:21,678 INFO L878 garLoopResultBuilder]: At program point L531(lines 379 532) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 main_~main__x~0)))) [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L367(lines 367 556) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L301(lines 301 688) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L235(lines 235 820) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L169(lines 169 952) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L103(lines 103 1084) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 1216) no Hoare annotation was computed. [2022-03-18 12:14:21,678 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 1258) no Hoare annotation was computed. [2022-03-18 12:14:21,679 INFO L878 garLoopResultBuilder]: At program point L1227(lines 31 1228) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 3)) [2022-03-18 12:14:21,679 INFO L878 garLoopResultBuilder]: At program point L1095(lines 97 1096) the Hoare annotation is: (and (<= main_~main__x~0 14) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,679 INFO L878 garLoopResultBuilder]: At program point L963(lines 163 964) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 25) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,680 INFO L878 garLoopResultBuilder]: At program point L831(lines 229 832) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 36)) [2022-03-18 12:14:21,680 INFO L878 garLoopResultBuilder]: At program point L699(lines 295 700) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 47)) [2022-03-18 12:14:21,680 INFO L878 garLoopResultBuilder]: At program point L567(lines 361 568) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 main_~main__x~0)))) [2022-03-18 12:14:21,680 INFO L882 garLoopResultBuilder]: For program point L403(lines 403 484) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L882 garLoopResultBuilder]: For program point L337(lines 337 616) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L882 garLoopResultBuilder]: For program point L271(lines 271 748) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L882 garLoopResultBuilder]: For program point L205(lines 205 880) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L882 garLoopResultBuilder]: For program point L139(lines 139 1012) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L882 garLoopResultBuilder]: For program point L73(lines 73 1144) no Hoare annotation was computed. [2022-03-18 12:14:21,681 INFO L878 garLoopResultBuilder]: At program point L1131(lines 79 1132) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 11)) [2022-03-18 12:14:21,681 INFO L878 garLoopResultBuilder]: At program point L999(lines 145 1000) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 22)) [2022-03-18 12:14:21,681 INFO L878 garLoopResultBuilder]: At program point L867(lines 211 868) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 33) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,681 INFO L878 garLoopResultBuilder]: At program point L735(lines 277 736) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 44) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,681 INFO L878 garLoopResultBuilder]: At program point L603(lines 343 604) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,682 INFO L878 garLoopResultBuilder]: At program point L471(lines 409 472) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__x~0 63) (<= main_~main__y~0 63)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (and (<= main_~main__y~0 66) .cse0 (<= main_~main__x~0 66) (<= 66 main_~main__x~0) (<= 66 main_~main__y~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 64) (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (<= 64 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)) (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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__x~0 65) (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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)))) [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L373(lines 373 544) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L307(lines 307 676) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L241(lines 241 808) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 940) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L109(lines 109 1072) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 1204) no Hoare annotation was computed. [2022-03-18 12:14:21,682 INFO L878 garLoopResultBuilder]: At program point L1167(lines 61 1168) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 8) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L1035(lines 127 1036) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 19) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L903(lines 193 904) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 30)) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L771(lines 259 772) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 41) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L639(lines 325 640) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L507(lines 391 508) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__x~0 63) (<= main_~main__y~0 63)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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)))) [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L442(lines 442 451) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L409(lines 409 472) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L343(lines 343 604) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L277(lines 277 736) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L211(lines 211 868) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L145(lines 145 1000) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point L79(lines 79 1132) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 444) no Hoare annotation was computed. [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L1203(lines 43 1204) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 5)) [2022-03-18 12:14:21,683 INFO L878 garLoopResultBuilder]: At program point L1071(lines 109 1072) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 16) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,684 INFO L878 garLoopResultBuilder]: At program point L939(lines 175 940) the Hoare annotation is: (and (<= main_~main__x~0 27) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,684 INFO L878 garLoopResultBuilder]: At program point L807(lines 241 808) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 38) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,684 INFO L878 garLoopResultBuilder]: At program point L675(lines 307 676) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 49) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,685 INFO L878 garLoopResultBuilder]: At program point L543(lines 373 544) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 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 (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 main_~main__x~0)))) [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L379(lines 379 532) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L313(lines 313 664) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L247(lines 247 796) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L181(lines 181 928) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L115(lines 115 1060) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L49(lines 49 1192) no Hoare annotation was computed. [2022-03-18 12:14:21,685 INFO L878 garLoopResultBuilder]: At program point L1239(lines 25 1240) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,685 INFO L878 garLoopResultBuilder]: At program point L1107(lines 91 1108) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 13) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,685 INFO L882 garLoopResultBuilder]: For program point L17(lines 17 1257) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L975(lines 157 976) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 24)) [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L843(lines 223 844) the Hoare annotation is: (and (<= main_~main__x~0 35) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L711(lines 289 712) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 46) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L579(lines 355 580) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)))) [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L415(lines 415 460) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L349(lines 349 592) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L283(lines 283 724) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L217(lines 217 856) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L151(lines 151 988) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L85(lines 85 1120) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 1252) no Hoare annotation was computed. [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L1143(lines 73 1144) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 10) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,686 INFO L878 garLoopResultBuilder]: At program point L1011(lines 139 1012) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 21)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L879(lines 205 880) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 32)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L747(lines 271 748) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 43)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L615(lines 337 616) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L483(lines 403 484) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__x~0 63) (<= main_~main__y~0 63)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 64) (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (<= 64 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)) (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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__x~0 65) (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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)))) [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L385(lines 385 520) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L319(lines 319 652) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 784) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 916) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L121(lines 121 1048) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L882 garLoopResultBuilder]: For program point L55(lines 55 1180) no Hoare annotation was computed. [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L1179(lines 55 1180) the Hoare annotation is: (and (<= main_~main__x~0 7) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L1047(lines 121 1048) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 18)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L915(lines 187 916) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 29) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L783(lines 253 784) the Hoare annotation is: (and (<= main_~main__x~0 40) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,687 INFO L878 garLoopResultBuilder]: At program point L651(lines 319 652) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L519(lines 385 520) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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)))) [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L355(lines 355 580) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L289(lines 289 712) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L223(lines 223 844) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L157(lines 157 976) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L91(lines 91 1108) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 1240) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L422(lines 422 433) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L1215(lines 37 1216) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 4) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L1083(lines 103 1084) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 15) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L951(lines 169 952) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 26) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L819(lines 235 820) the Hoare annotation is: (and (<= main_~main__x~0 37) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L687(lines 301 688) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 48)) [2022-03-18 12:14:21,688 INFO L878 garLoopResultBuilder]: At program point L555(lines 367 556) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 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 (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 main_~main__x~0)))) [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L391(lines 391 508) no Hoare annotation was computed. [2022-03-18 12:14:21,688 INFO L882 garLoopResultBuilder]: For program point L325(lines 325 640) no Hoare annotation was computed. [2022-03-18 12:14:21,689 INFO L882 garLoopResultBuilder]: For program point L259(lines 259 772) no Hoare annotation was computed. [2022-03-18 12:14:21,689 INFO L882 garLoopResultBuilder]: For program point L193(lines 193 904) no Hoare annotation was computed. [2022-03-18 12:14:21,689 INFO L882 garLoopResultBuilder]: For program point L127(lines 127 1036) no Hoare annotation was computed. [2022-03-18 12:14:21,689 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 1168) no Hoare annotation was computed. [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L1251(lines 19 1252) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 1)) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L1119(lines 85 1120) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 12)) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L987(lines 151 988) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 23)) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L855(lines 217 856) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 34)) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L723(lines 283 724) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 45)) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L591(lines 349 592) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 54) .cse0 (<= 54 main_~main__y~0) (<= main_~main__y~0 54) (<= 54 main_~main__x~0)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point L459(lines 415 460) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= 80 main_~main__y~0) .cse0 (< main_~main__x~0 81) (<= main_~main__y~0 80) (<= 80 main_~main__x~0)) (and (< main_~main__x~0 97) .cse0 (<= 96 main_~main__x~0) (<= main_~main__y~0 96) (<= 96 main_~main__y~0)) (and (<= 100 main_~main__x~0) (< 99 main_~main__y~0) .cse0 (<= main_~main__y~0 100)) (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 83 main_~main__y~0) (<= main_~main__y~0 83) .cse0 (<= 83 main_~main__x~0) (< main_~main__x~0 84)) (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__x~0 90) (<= 89 main_~main__y~0) (<= main_~main__y~0 89) .cse0 (<= 89 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= 86 main_~main__y~0) (< main_~main__x~0 87) .cse0 (<= main_~main__y~0 86)) (and (<= main_~main__y~0 68) (<= main_~main__x~0 68) (<= 68 main_~main__y~0) (<= 68 main_~main__x~0) .cse0) (and (< main_~main__x~0 79) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0) .cse0) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 67) (<= 67 main_~main__y~0) (<= main_~main__x~0 67) .cse0 (<= 67 main_~main__x~0)) (and (< main_~main__x~0 91) (<= main_~main__y~0 90) .cse0 (<= 90 main_~main__x~0) (<= 90 main_~main__y~0)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (and (<= 73 main_~main__y~0) (< main_~main__x~0 74) .cse0 (<= main_~main__y~0 73) (<= 73 main_~main__x~0)) (and (<= 94 main_~main__y~0) (<= main_~main__y~0 94) (< main_~main__x~0 95) .cse0 (<= 94 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__x~0) (<= 84 main_~main__y~0) .cse0 (< main_~main__x~0 85)) (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 98) (<= 98 main_~main__y~0) (<= 98 main_~main__x~0) .cse0 (< main_~main__x~0 99)) (and (<= 93 main_~main__y~0) .cse0 (< main_~main__x~0 94) (<= 93 main_~main__x~0) (<= main_~main__y~0 93)) (and (<= 82 main_~main__x~0) .cse0 (<= 82 main_~main__y~0) (< main_~main__x~0 83) (<= main_~main__y~0 82)) (and (<= 74 main_~main__y~0) (< main_~main__x~0 75) .cse0 (<= 74 main_~main__x~0) (<= main_~main__y~0 74)) (and (<= 52 main_~main__y~0) (<= 52 main_~main__x~0) .cse0 (<= main_~main__x~0 52) (<= main_~main__y~0 52)) (and (<= 71 main_~main__y~0) (<= main_~main__y~0 71) .cse0 (< main_~main__x~0 72) (<= 71 main_~main__x~0)) (and .cse0 (<= main_~main__y~0 88) (< main_~main__x~0 89) (<= 88 main_~main__y~0) (<= 88 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 64) (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (<= 64 main_~main__x~0)) (and (< main_~main__x~0 96) (<= 95 main_~main__y~0) .cse0 (<= main_~main__y~0 95) (<= 95 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)) (and (<= 75 main_~main__x~0) (<= main_~main__y~0 75) .cse0 (< main_~main__x~0 76) (<= 75 main_~main__y~0)) (and (<= main_~main__y~0 72) (<= 72 main_~main__x~0) (< main_~main__x~0 73) (<= 72 main_~main__y~0) .cse0) (and (<= 70 main_~main__y~0) (<= 70 main_~main__x~0) (<= main_~main__y~0 70) .cse0 (< main_~main__x~0 71)) (and (<= 92 main_~main__x~0) .cse0 (<= 92 main_~main__y~0) (<= main_~main__y~0 92) (< main_~main__x~0 93)) (and (<= 91 main_~main__y~0) (<= 91 main_~main__x~0) (< main_~main__x~0 92) .cse0 (<= main_~main__y~0 91)) (and (<= 81 main_~main__x~0) (<= main_~main__y~0 81) (<= 81 main_~main__y~0) .cse0 (< main_~main__x~0 82)) (and (<= 61 main_~main__x~0) (<= main_~main__x~0 61) (<= main_~main__y~0 61) (<= 61 main_~main__y~0) .cse0) (and (<= 87 main_~main__x~0) (< main_~main__x~0 88) (<= 87 main_~main__y~0) (<= main_~main__y~0 87) .cse0) (and (<= main_~main__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__x~0 65) (<= 65 main_~main__x~0) (<= 65 main_~main__y~0) .cse0 (<= main_~main__y~0 65)) (and (<= main_~main__y~0 85) (< main_~main__x~0 86) .cse0 (<= 85 main_~main__x~0) (<= 85 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 (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (< main_~main__x~0 80) (<= main_~main__y~0 79) .cse0 (<= 79 main_~main__x~0) (<= 79 main_~main__y~0)) (and (<= 77 main_~main__x~0) .cse0 (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (< main_~main__x~0 78)) (and (<= main_~main__y~0 69) (< main_~main__x~0 70) .cse0 (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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 (<= 76 main_~main__x~0) .cse0 (<= main_~main__y~0 76) (<= 76 main_~main__y~0) (< main_~main__x~0 77)) (and (< main_~main__x~0 100) (<= main_~main__y~0 99) .cse0 (<= 99 main_~main__y~0) (<= 99 main_~main__x~0)))) [2022-03-18 12:14:21,689 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 1258) the Hoare annotation is: (= |old(~__return_1121~0)| ~__return_1121~0) [2022-03-18 12:14:21,689 INFO L882 garLoopResultBuilder]: For program point L361(lines 361 568) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L882 garLoopResultBuilder]: For program point L295(lines 295 700) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L882 garLoopResultBuilder]: For program point L229(lines 229 832) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L882 garLoopResultBuilder]: For program point L163(lines 163 964) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L882 garLoopResultBuilder]: For program point L97(lines 97 1096) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 1228) no Hoare annotation was computed. [2022-03-18 12:14:21,697 INFO L878 garLoopResultBuilder]: At program point L1155(lines 67 1156) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 9)) [2022-03-18 12:14:21,699 INFO L878 garLoopResultBuilder]: At program point L1023(lines 133 1024) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 20) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,699 INFO L878 garLoopResultBuilder]: At program point L891(lines 199 892) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 31)) [2022-03-18 12:14:21,699 INFO L878 garLoopResultBuilder]: At program point L759(lines 265 760) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 42) (= |old(~__return_1121~0)| ~__return_1121~0)) [2022-03-18 12:14:21,699 INFO L878 garLoopResultBuilder]: At program point L627(lines 331 628) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)))) [2022-03-18 12:14:21,699 INFO L878 garLoopResultBuilder]: At program point L495(lines 397 496) the Hoare annotation is: (let ((.cse0 (= |old(~__return_1121~0)| ~__return_1121~0))) (or (and (<= main_~main__x~0 56) .cse0 (<= 56 main_~main__x~0) (<= 56 main_~main__y~0) (<= main_~main__y~0 56)) (and (<= 63 main_~main__y~0) (<= 63 main_~main__x~0) .cse0 (<= main_~main__x~0 63) (<= main_~main__y~0 63)) (and (<= 53 main_~main__y~0) (<= main_~main__y~0 53) .cse0 (<= 53 main_~main__x~0) (<= main_~main__x~0 53)) (and (<= 55 main_~main__y~0) (<= 55 main_~main__x~0) (<= main_~main__y~0 55) .cse0 (<= main_~main__x~0 55)) (and (<= main_~main__y~0 60) (<= main_~main__x~0 60) (<= 60 main_~main__y~0) .cse0 (<= 60 main_~main__x~0)) (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 50) (<= 50 main_~main__y~0) .cse0 (<= main_~main__x~0 50)) (and (<= main_~main__x~0 64) (<= 64 main_~main__y~0) .cse0 (<= main_~main__y~0 64) (<= 64 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)) (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__x~0 59) (<= 59 main_~main__x~0) (<= 59 main_~main__y~0) .cse0 (<= main_~main__y~0 59)) (and (<= main_~main__y~0 51) (<= main_~main__x~0 51) .cse0 (<= 51 main_~main__y~0) (<= 51 main_~main__x~0)) (and (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57) .cse0 (<= 57 main_~main__y~0)) (and (<= main_~main__x~0 58) .cse0 (<= main_~main__y~0 58) (<= 58 main_~main__y~0) (<= 58 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)))) [2022-03-18 12:14:21,699 INFO L882 garLoopResultBuilder]: For program point L397(lines 397 496) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point L331(lines 331 628) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point L265(lines 265 760) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point L199(lines 199 892) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point L133(lines 133 1024) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point L67(lines 67 1156) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L878 garLoopResultBuilder]: At program point L1191(lines 49 1192) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 6)) [2022-03-18 12:14:21,700 INFO L878 garLoopResultBuilder]: At program point L1059(lines 115 1060) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (= |old(~__return_1121~0)| ~__return_1121~0) (<= main_~main__x~0 17)) [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_1121~0)| ~__return_1121~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-18 12:14:21,700 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 12:14:21,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 12:14:21,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-18 12:14:21,710 INFO L718 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 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-03-18 12:14:21,711 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 12:14:21,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 12:14:21 BoogieIcfgContainer [2022-03-18 12:14:21,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 12:14:21,772 INFO L158 Benchmark]: Toolchain (without parser) took 63548.65ms. Allocated memory was 175.1MB in the beginning and 367.0MB in the end (delta: 191.9MB). Free memory was 146.7MB in the beginning and 148.0MB in the end (delta: -1.3MB). Peak memory consumption was 219.1MB. Max. memory is 8.0GB. [2022-03-18 12:14:21,772 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 12:14:21,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.16ms. Allocated memory is still 175.1MB. Free memory was 146.5MB in the beginning and 140.9MB in the end (delta: 5.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-03-18 12:14:21,772 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 175.1MB. Free memory was 140.9MB in the beginning and 138.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 12:14:21,773 INFO L158 Benchmark]: RCFGBuilder took 565.51ms. Allocated memory is still 175.1MB. Free memory was 138.4MB in the beginning and 99.3MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-03-18 12:14:21,773 INFO L158 Benchmark]: TraceAbstraction took 62635.60ms. Allocated memory was 175.1MB in the beginning and 367.0MB in the end (delta: 191.9MB). Free memory was 98.7MB in the beginning and 148.0MB in the end (delta: -49.3MB). Peak memory consumption was 172.0MB. Max. memory is 8.0GB. [2022-03-18 12:14:21,773 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.16ms. Allocated memory is still 175.1MB. Free memory was 146.5MB in the beginning and 140.9MB in the end (delta: 5.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 175.1MB. Free memory was 140.9MB in the beginning and 138.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 565.51ms. Allocated memory is still 175.1MB. Free memory was 138.4MB in the beginning and 99.3MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 62635.60ms. Allocated memory was 175.1MB in the beginning and 367.0MB in the end (delta: 191.9MB). Free memory was 98.7MB in the beginning and 148.0MB in the end (delta: -49.3MB). Peak memory consumption was 172.0MB. 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: 444]: 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 5 procedures, 156 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.5s, OverallIterations: 30, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8518 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8518 mSDsluCounter, 4870 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 883 mSDsCounter, 5035 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49755 IncrementalHoareTripleChecker+Invalid, 54790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5035 mSolverCounterUnsat, 3987 mSDtfsCounter, 49755 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2601 GetRequests, 757 SyntacticMatches, 6 SemanticMatches, 1838 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21599 ImplicationChecksByTransitivity, 33.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=29, InterpolantAutomatonStates: 993, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 324 NumberOfFragments, 3879 HoareAnnotationTreeSize, 71 FomulaSimplifications, 507 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 71 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 4780 NumberOfCodeBlocks, 4780 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5100 ConstructedInterpolants, 0 QuantifiedInterpolants, 12907 SizeOfPredicates, 2 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 1156/4426 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: 43]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 5 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 31 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 32 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 44) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 43 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((80 <= main__y && \old(__return_1121) == __return_1121) && main__x < 81) && main__y <= 80) && 80 <= main__x) || ((((main__x < 97 && \old(__return_1121) == __return_1121) && 96 <= main__x) && main__y <= 96) && 96 <= main__y)) || (((100 <= main__x && 99 < main__y) && \old(__return_1121) == __return_1121) && main__y <= 100)) || ((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56)) || ((((83 <= main__y && main__y <= 83) && \old(__return_1121) == __return_1121) && 83 <= main__x) && main__x < 84)) || ((((63 <= main__y && 63 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 63) && main__y <= 63)) || ((((main__x < 90 && 89 <= main__y) && main__y <= 89) && \old(__return_1121) == __return_1121) && 89 <= main__x)) || ((((86 <= main__x && 86 <= main__y) && main__x < 87) && \old(__return_1121) == __return_1121) && main__y <= 86)) || ((((main__y <= 68 && main__x <= 68) && 68 <= main__y) && 68 <= main__x) && \old(__return_1121) == __return_1121)) || ((((main__x < 79 && main__y <= 78) && 78 <= main__x) && 78 <= main__y) && \old(__return_1121) == __return_1121)) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 67 && 67 <= main__y) && main__x <= 67) && \old(__return_1121) == __return_1121) && 67 <= main__x)) || ((((main__x < 91 && main__y <= 90) && \old(__return_1121) == __return_1121) && 90 <= main__x) && 90 <= main__y)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((73 <= main__y && main__x < 74) && \old(__return_1121) == __return_1121) && main__y <= 73) && 73 <= main__x)) || ((((94 <= main__y && main__y <= 94) && main__x < 95) && \old(__return_1121) == __return_1121) && 94 <= main__x)) || ((((main__y <= 84 && 84 <= main__x) && 84 <= main__y) && \old(__return_1121) == __return_1121) && main__x < 85)) || ((((main__y <= 66 && \old(__return_1121) == __return_1121) && main__x <= 66) && 66 <= main__x) && 66 <= main__y)) || ((((main__y <= 98 && 98 <= main__y) && 98 <= main__x) && \old(__return_1121) == __return_1121) && main__x < 99)) || ((((93 <= main__y && \old(__return_1121) == __return_1121) && main__x < 94) && 93 <= main__x) && main__y <= 93)) || ((((82 <= main__x && \old(__return_1121) == __return_1121) && 82 <= main__y) && main__x < 83) && main__y <= 82)) || ((((74 <= main__y && main__x < 75) && \old(__return_1121) == __return_1121) && 74 <= main__x) && main__y <= 74)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || ((((71 <= main__y && main__y <= 71) && \old(__return_1121) == __return_1121) && main__x < 72) && 71 <= main__x)) || ((((\old(__return_1121) == __return_1121 && main__y <= 88) && main__x < 89) && 88 <= main__y) && 88 <= main__x)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 64 && 64 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 64) && 64 <= main__x)) || ((((main__x < 96 && 95 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 95) && 95 <= main__x)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((75 <= main__x && main__y <= 75) && \old(__return_1121) == __return_1121) && main__x < 76) && 75 <= main__y)) || ((((main__y <= 72 && 72 <= main__x) && main__x < 73) && 72 <= main__y) && \old(__return_1121) == __return_1121)) || ((((70 <= main__y && 70 <= main__x) && main__y <= 70) && \old(__return_1121) == __return_1121) && main__x < 71)) || ((((92 <= main__x && \old(__return_1121) == __return_1121) && 92 <= main__y) && main__y <= 92) && main__x < 93)) || ((((91 <= main__y && 91 <= main__x) && main__x < 92) && \old(__return_1121) == __return_1121) && main__y <= 91)) || ((((81 <= main__x && main__y <= 81) && 81 <= main__y) && \old(__return_1121) == __return_1121) && main__x < 82)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((87 <= main__x && main__x < 88) && 87 <= main__y) && main__y <= 87) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__x <= 65 && 65 <= main__x) && 65 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 65)) || ((((main__y <= 85 && main__x < 86) && \old(__return_1121) == __return_1121) && 85 <= main__x) && 85 <= main__y)) || ((((main__y <= 97 && 97 <= main__y) && \old(__return_1121) == __return_1121) && 97 <= main__x) && main__x < 98)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x < 80 && main__y <= 79) && \old(__return_1121) == __return_1121) && 79 <= main__x) && 79 <= main__y)) || ((((77 <= main__x && \old(__return_1121) == __return_1121) && main__y <= 77) && 77 <= main__y) && main__x < 78)) || ((((main__y <= 69 && main__x < 70) && \old(__return_1121) == __return_1121) && 69 <= main__y) && 69 <= main__x)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y)) || ((((76 <= main__x && \old(__return_1121) == __return_1121) && main__y <= 76) && 76 <= main__y) && main__x < 77)) || ((((main__x < 100 && main__y <= 99) && \old(__return_1121) == __return_1121) && 99 <= main__y) && 99 <= main__x) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 34 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 19) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 8) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 18 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 4) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 28) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 49) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 10) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 11 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 3 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 23 - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 38) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((main__x <= 40 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 20) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 26) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 24 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__x <= 7 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__x <= 14 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 48 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 9 - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 1 - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 46) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 17 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 13) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((63 <= main__y && 63 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 63) && main__y <= 63)) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 36 - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: (((((((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((63 <= main__y && 63 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 63) && main__y <= 63)) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((main__y <= 66 && \old(__return_1121) == __return_1121) && main__x <= 66) && 66 <= main__x) && 66 <= main__y)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 64 && 64 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 64) && 64 <= main__x)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__x <= 65 && 65 <= main__x) && 65 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 65)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 21 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50 - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((63 <= main__y && 63 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 63) && main__y <= 63)) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 64 && 64 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 64) && 64 <= main__x)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 30 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 12 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((main__x <= 27 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((63 <= main__y && 63 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 63) && main__y <= 63)) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 64 && 64 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 64) && 64 <= main__x)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__x <= 65 && 65 <= main__x) && 65 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 65)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 33) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 22 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((((((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x)) || ((((main__y <= 62 && \old(__return_1121) == __return_1121) && main__x <= 62) && 62 <= main__x) && 62 <= main__y) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((((((((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((main__y <= 60 && main__x <= 60) && 60 <= main__y) && \old(__return_1121) == __return_1121) && 60 <= main__x)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((61 <= main__x && main__x <= 61) && main__y <= 61) && 61 <= main__y) && \old(__return_1121) == __return_1121)) || ((((main__x <= 59 && 59 <= main__x) && 59 <= main__y) && \old(__return_1121) == __return_1121) && main__y <= 59)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x)) || ((((main__y <= 57 && 57 <= main__x) && main__x <= 57) && \old(__return_1121) == __return_1121) && 57 <= main__y)) || ((((main__x <= 58 && \old(__return_1121) == __return_1121) && main__y <= 58) && 58 <= main__y) && 58 <= main__x) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 29) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 25) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 6 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 15) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: (((((((((main__x <= 56 && \old(__return_1121) == __return_1121) && 56 <= main__x) && 56 <= main__y) && main__y <= 56) || ((((53 <= main__y && main__y <= 53) && \old(__return_1121) == __return_1121) && 53 <= main__x) && main__x <= 53)) || ((((55 <= main__y && 55 <= main__x) && main__y <= 55) && \old(__return_1121) == __return_1121) && main__x <= 55)) || ((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52)) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__x <= 54 && \old(__return_1121) == __return_1121) && 54 <= main__y) && main__y <= 54) && 54 <= main__x)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 16) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 45 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 2) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((main__x <= 35 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 42) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 47 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((52 <= main__y && 52 <= main__x) && \old(__return_1121) == __return_1121) && main__x <= 52) && main__y <= 52) || (((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 50)) || ((((main__y <= 51 && main__x <= 51) && \old(__return_1121) == __return_1121) && 51 <= main__y) && 51 <= main__x) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((main__x <= 37 && main__y <= 50) && 50 <= main__y) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 41) && \old(__return_1121) == __return_1121 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && \old(__return_1121) == __return_1121) && main__x <= 39 RESULT: Ultimate proved your program to be correct! [2022-03-18 12:14:21,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...