/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:26:51,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:26:51,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:26:51,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:26:51,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:26:51,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:26:51,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:26:51,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:26:51,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:26:51,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:26:51,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:26:51,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:26:51,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:26:51,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:26:51,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:26:51,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:26:51,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:26:51,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:26:51,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:26:51,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:26:51,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:26:51,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:26:51,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:26:51,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:26:51,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:26:51,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:26:51,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:26:51,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:26:51,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:26:51,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:26:51,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:26:51,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:26:51,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:26:51,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:26:51,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:26:51,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:26:51,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:26:51,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:26:51,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:26:51,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:26:51,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:26:51,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:26:51,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:26:51,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:26:51,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:26:51,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:26:51,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:26:51,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:26:51,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:26:51,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:26:51,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:26:51,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:26:51,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:26:51,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:26:51,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:26:51,551 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-01-09 23:26:51,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:26:51,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:26:51,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:26:51,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:26:51,760 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:26:51,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-01-09 23:26:51,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b188df19/8fea685f175d4dffa5ded097929472de/FLAG5bcdbf0d0 [2022-01-09 23:26:52,178 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:26:52,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-01-09 23:26:52,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b188df19/8fea685f175d4dffa5ded097929472de/FLAG5bcdbf0d0 [2022-01-09 23:26:52,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b188df19/8fea685f175d4dffa5ded097929472de [2022-01-09 23:26:52,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:26:52,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:26:52,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:26:52,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:26:52,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:26:52,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4d7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52, skipping insertion in model container [2022-01-09 23:26:52,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:26:52,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:26:52,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-01-09 23:26:52,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:26:52,389 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:26:52,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-01-09 23:26:52,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:26:52,447 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:26:52,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52 WrapperNode [2022-01-09 23:26:52,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:26:52,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:26:52,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:26:52,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:26:52,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,484 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2022-01-09 23:26:52,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:26:52,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:26:52,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:26:52,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:26:52,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:26:52,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:26:52,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:26:52,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:26:52,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (1/1) ... [2022-01-09 23:26:52,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:26:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:26:52,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-09 23:26:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-09 23:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:26:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:26:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:26:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:26:52,637 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:26:52,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:26:52,844 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:26:52,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:26:52,849 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 23:26:52,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:26:52 BoogieIcfgContainer [2022-01-09 23:26:52,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:26:52,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:26:52,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:26:52,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:26:52,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:26:52" (1/3) ... [2022-01-09 23:26:52,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535fa26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:26:52, skipping insertion in model container [2022-01-09 23:26:52,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:52" (2/3) ... [2022-01-09 23:26:52,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535fa26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:26:52, skipping insertion in model container [2022-01-09 23:26:52,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:26:52" (3/3) ... [2022-01-09 23:26:52,856 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-01-09 23:26:52,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:26:52,875 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:26:52,919 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:26:52,926 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:26:52,926 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:26:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-09 23:26:52,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:52,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-09 23:26:52,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 28699930, now seen corresponding path program 1 times [2022-01-09 23:26:52,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:52,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412688349] [2022-01-09 23:26:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:52,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:53,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412688349] [2022-01-09 23:26:53,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412688349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565933291] [2022-01-09 23:26:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,090 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,152 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2022-01-09 23:26:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-01-09 23:26:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,159 INFO L225 Difference]: With dead ends: 131 [2022-01-09 23:26:53,159 INFO L226 Difference]: Without dead ends: 79 [2022-01-09 23:26:53,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,164 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-09 23:26:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-01-09 23:26:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2022-01-09 23:26:53,190 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 5 [2022-01-09 23:26:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,190 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2022-01-09 23:26:53,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2022-01-09 23:26:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-09 23:26:53,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,191 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:26:53,191 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1485309586, now seen corresponding path program 1 times [2022-01-09 23:26:53,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120234212] [2022-01-09 23:26:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:53,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120234212] [2022-01-09 23:26:53,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120234212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171675087] [2022-01-09 23:26:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,217 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,252 INFO L93 Difference]: Finished difference Result 156 states and 246 transitions. [2022-01-09 23:26:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-09 23:26:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,253 INFO L225 Difference]: With dead ends: 156 [2022-01-09 23:26:53,253 INFO L226 Difference]: Without dead ends: 116 [2022-01-09 23:26:53,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,254 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 161 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-09 23:26:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-01-09 23:26:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 175 transitions. [2022-01-09 23:26:53,265 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 175 transitions. Word has length 10 [2022-01-09 23:26:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,265 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 175 transitions. [2022-01-09 23:26:53,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2022-01-09 23:26:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:26:53,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,266 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:26:53,266 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1152886494, now seen corresponding path program 1 times [2022-01-09 23:26:53,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404641996] [2022-01-09 23:26:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-09 23:26:53,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404641996] [2022-01-09 23:26:53,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404641996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103958825] [2022-01-09 23:26:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,294 INFO L87 Difference]: Start difference. First operand 116 states and 175 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,327 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2022-01-09 23:26:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-09 23:26:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,328 INFO L225 Difference]: With dead ends: 230 [2022-01-09 23:26:53,328 INFO L226 Difference]: Without dead ends: 153 [2022-01-09 23:26:53,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,330 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-09 23:26:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-01-09 23:26:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 230 transitions. [2022-01-09 23:26:53,342 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 230 transitions. Word has length 16 [2022-01-09 23:26:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,342 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 230 transitions. [2022-01-09 23:26:53,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2022-01-09 23:26:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-09 23:26:53,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,343 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 23:26:53,343 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash -77104047, now seen corresponding path program 1 times [2022-01-09 23:26:53,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112780323] [2022-01-09 23:26:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-09 23:26:53,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112780323] [2022-01-09 23:26:53,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112780323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430467579] [2022-01-09 23:26:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,373 INFO L87 Difference]: Start difference. First operand 153 states and 230 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,419 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-01-09 23:26:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-09 23:26:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,420 INFO L225 Difference]: With dead ends: 321 [2022-01-09 23:26:53,420 INFO L226 Difference]: Without dead ends: 170 [2022-01-09 23:26:53,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,422 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-09 23:26:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2022-01-09 23:26:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2022-01-09 23:26:53,432 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 31 [2022-01-09 23:26:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2022-01-09 23:26:53,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2022-01-09 23:26:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-09 23:26:53,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,433 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 23:26:53,434 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1611839695, now seen corresponding path program 1 times [2022-01-09 23:26:53,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437605982] [2022-01-09 23:26:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-09 23:26:53,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437605982] [2022-01-09 23:26:53,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437605982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446721907] [2022-01-09 23:26:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,461 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,591 INFO L93 Difference]: Finished difference Result 378 states and 567 transitions. [2022-01-09 23:26:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-09 23:26:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,605 INFO L225 Difference]: With dead ends: 378 [2022-01-09 23:26:53,605 INFO L226 Difference]: Without dead ends: 212 [2022-01-09 23:26:53,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,606 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-09 23:26:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-01-09 23:26:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 285 transitions. [2022-01-09 23:26:53,618 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 285 transitions. Word has length 31 [2022-01-09 23:26:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,619 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 285 transitions. [2022-01-09 23:26:53,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 285 transitions. [2022-01-09 23:26:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 23:26:53,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,620 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 23:26:53,620 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash -359756882, now seen corresponding path program 1 times [2022-01-09 23:26:53,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240900719] [2022-01-09 23:26:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-09 23:26:53,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240900719] [2022-01-09 23:26:53,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240900719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478157556] [2022-01-09 23:26:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,696 INFO L87 Difference]: Start difference. First operand 207 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,738 INFO L93 Difference]: Finished difference Result 414 states and 577 transitions. [2022-01-09 23:26:53,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-09 23:26:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,741 INFO L225 Difference]: With dead ends: 414 [2022-01-09 23:26:53,741 INFO L226 Difference]: Without dead ends: 264 [2022-01-09 23:26:53,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,742 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 163 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-01-09 23:26:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2022-01-09 23:26:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2022-01-09 23:26:53,756 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 45 [2022-01-09 23:26:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,756 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2022-01-09 23:26:53,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2022-01-09 23:26:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-09 23:26:53,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,758 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 23:26:53,758 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1572307813, now seen corresponding path program 1 times [2022-01-09 23:26:53,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304740403] [2022-01-09 23:26:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-09 23:26:53,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304740403] [2022-01-09 23:26:53,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304740403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583720327] [2022-01-09 23:26:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,787 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,846 INFO L93 Difference]: Finished difference Result 520 states and 731 transitions. [2022-01-09 23:26:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-01-09 23:26:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,847 INFO L225 Difference]: With dead ends: 520 [2022-01-09 23:26:53,847 INFO L226 Difference]: Without dead ends: 182 [2022-01-09 23:26:53,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,848 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-09 23:26:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2022-01-09 23:26:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2022-01-09 23:26:53,864 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 48 [2022-01-09 23:26:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,864 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2022-01-09 23:26:53,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2022-01-09 23:26:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-09 23:26:53,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:53,866 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:53,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 23:26:53,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1927293386, now seen corresponding path program 1 times [2022-01-09 23:26:53,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:53,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794770358] [2022-01-09 23:26:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:53,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-09 23:26:53,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794770358] [2022-01-09 23:26:53,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794770358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:53,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:53,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:53,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182137219] [2022-01-09 23:26:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:53,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:53,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:53,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,904 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:53,911 INFO L93 Difference]: Finished difference Result 271 states and 328 transitions. [2022-01-09 23:26:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-01-09 23:26:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:53,912 INFO L225 Difference]: With dead ends: 271 [2022-01-09 23:26:53,912 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 23:26:53,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:53,913 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:53,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:26:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 23:26:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 23:26:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 23:26:53,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-01-09 23:26:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:53,914 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 23:26:53,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 23:26:53,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 23:26:53,918 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 23:26:53,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 23:26:53,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 23:26:54,096 INFO L861 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-01-09 23:26:54,096 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 130) no Hoare annotation was computed. [2022-01-09 23:26:54,096 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 207) no Hoare annotation was computed. [2022-01-09 23:26:54,096 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-01-09 23:26:54,096 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 122) no Hoare annotation was computed. [2022-01-09 23:26:54,096 INFO L854 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 2)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 1)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 3)))) [2022-01-09 23:26:54,096 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 211) no Hoare annotation was computed. [2022-01-09 23:26:54,096 INFO L854 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 1) .cse0) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) (= |ULTIMATE.start_main_~blastFlag~0#1| 3) .cse0) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 2) .cse0))) [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 215) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L854 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L854 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L854 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-01-09 23:26:54,097 INFO L854 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,097 INFO L854 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,097 INFO L861 garLoopResultBuilder]: At program point L228(lines 20 229) the Hoare annotation is: true [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 197) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 201) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 86 195) no Hoare annotation was computed. [2022-01-09 23:26:54,097 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 205) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 86 195) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L854 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 3))) (or (= |ULTIMATE.start_main_~blastFlag~0#1| 1) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) .cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|)) (= |ULTIMATE.start_main_~blastFlag~0#1| 2) (and (<= 8672 |ULTIMATE.start_main_~s__state~0#1|) .cse0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0))) [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 209) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L854 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 1) .cse0) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) (= |ULTIMATE.start_main_~blastFlag~0#1| 3) .cse0) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 2) .cse0))) [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 213) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L854 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,098 INFO L854 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-09 23:26:54,098 INFO L854 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,098 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 92) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 86 195) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L854 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0))) (or (and .cse0 (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 0) .cse0) (and (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) .cse0))) [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 216) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L854 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L854 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L174-1(lines 174 176) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L854 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 135) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 195) no Hoare annotation was computed. [2022-01-09 23:26:54,099 INFO L858 garLoopResultBuilder]: For program point L76(lines 76 199) no Hoare annotation was computed. [2022-01-09 23:26:54,100 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 203) no Hoare annotation was computed. [2022-01-09 23:26:54,100 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-09 23:26:54,102 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:54,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 23:26:54,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:26:54 BoogieIcfgContainer [2022-01-09 23:26:54,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 23:26:54,115 INFO L158 Benchmark]: Toolchain (without parser) took 1917.54ms. Allocated memory was 164.6MB in the beginning and 257.9MB in the end (delta: 93.3MB). Free memory was 110.3MB in the beginning and 102.8MB in the end (delta: 7.5MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,115 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory was 126.6MB in the beginning and 126.5MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:26:54,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.15ms. Allocated memory was 164.6MB in the beginning and 257.9MB in the end (delta: 93.3MB). Free memory was 110.1MB in the beginning and 230.7MB in the end (delta: -120.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.21ms. Allocated memory is still 257.9MB. Free memory was 230.7MB in the beginning and 229.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,116 INFO L158 Benchmark]: Boogie Preprocessor took 12.31ms. Allocated memory is still 257.9MB. Free memory was 229.1MB in the beginning and 228.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,116 INFO L158 Benchmark]: RCFGBuilder took 352.71ms. Allocated memory is still 257.9MB. Free memory was 227.5MB in the beginning and 214.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,116 INFO L158 Benchmark]: TraceAbstraction took 1262.92ms. Allocated memory is still 257.9MB. Free memory was 213.9MB in the beginning and 102.8MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. Max. memory is 8.0GB. [2022-01-09 23:26:54,117 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.10ms. Allocated memory is still 164.6MB. Free memory was 126.6MB in the beginning and 126.5MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.15ms. Allocated memory was 164.6MB in the beginning and 257.9MB in the end (delta: 93.3MB). Free memory was 110.1MB in the beginning and 230.7MB in the end (delta: -120.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.21ms. Allocated memory is still 257.9MB. Free memory was 230.7MB in the beginning and 229.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.31ms. Allocated memory is still 257.9MB. Free memory was 229.1MB in the beginning and 228.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 352.71ms. Allocated memory is still 257.9MB. Free memory was 227.5MB in the beginning and 214.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1262.92ms. Allocated memory is still 257.9MB. Free memory was 213.9MB in the beginning and 102.8MB in the end (delta: 111.1MB). Peak memory consumption was 111.1MB. 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: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 671 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 85 NumberOfFragments, 298 HoareAnnotationTreeSize, 18 FomulaSimplifications, 124 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 218/218 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag == 0) || (8672 <= s__state && blastFlag == 2)) || (8672 <= s__state && blastFlag == 1)) || (8672 <= s__state && blastFlag == 3) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag == 0) || (blastFlag == 1 && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || (blastFlag == 2 && 8640 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag == 0) || (blastFlag == 1 && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || (blastFlag == 2 && 8640 <= s__state) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((-8512 + s__state == 0 && -1 + blastFlag == 0) || (blastFlag == 0 && -8512 + s__state == 0)) || (-2 + blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((blastFlag == 1 || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || blastFlag == 2) || (8672 <= s__state && blastFlag == 3)) || blastFlag == 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-01-09 23:26:54,157 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...