/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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 22:23:35,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 22:23:35,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 22:23:35,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 22:23:35,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 22:23:35,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 22:23:35,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 22:23:35,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 22:23:35,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 22:23:35,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 22:23:35,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 22:23:35,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 22:23:35,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 22:23:35,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 22:23:35,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 22:23:35,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 22:23:35,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 22:23:35,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 22:23:35,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 22:23:35,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 22:23:35,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 22:23:35,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 22:23:35,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 22:23:35,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 22:23:35,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 22:23:35,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 22:23:35,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 22:23:35,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 22:23:35,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 22:23:35,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 22:23:35,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 22:23:35,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 22:23:35,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 22:23:35,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 22:23:35,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 22:23:35,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 22:23:35,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 22:23:35,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 22:23:35,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 22:23:35,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 22:23:35,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 22:23:35,249 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 22:23:35,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 22:23:35,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 22:23:35,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 22:23:35,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 22:23:35,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 22:23:35,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 22:23:35,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 22:23:35,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 22:23:35,283 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 22:23:35,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 22:23:35,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 22:23:35,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 22:23:35,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 22:23:35,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 22:23:35,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 22:23:35,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:23:35,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 22:23:35,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 22:23:35,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 22:23:35,286 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 22:23:35,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 22:23:35,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 22:23:35,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 22:23:35,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 22:23:35,530 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 22:23:35,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-01-09 22:23:35,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f519ee9/5396430d41e6445b864e8e3b6bf172fc/FLAG8426724cd [2022-01-09 22:23:35,934 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 22:23:35,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-01-09 22:23:35,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f519ee9/5396430d41e6445b864e8e3b6bf172fc/FLAG8426724cd [2022-01-09 22:23:36,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f519ee9/5396430d41e6445b864e8e3b6bf172fc [2022-01-09 22:23:36,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 22:23:36,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 22:23:36,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 22:23:36,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 22:23:36,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 22:23:36,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c8f2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36, skipping insertion in model container [2022-01-09 22:23:36,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 22:23:36,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 22:23:36,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-01-09 22:23:36,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:23:36,540 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 22:23:36,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-01-09 22:23:36,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:23:36,563 INFO L208 MainTranslator]: Completed translation [2022-01-09 22:23:36,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36 WrapperNode [2022-01-09 22:23:36,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 22:23:36,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 22:23:36,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 22:23:36,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 22:23:36,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,591 INFO L137 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-01-09 22:23:36,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 22:23:36,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 22:23:36,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 22:23:36,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 22:23:36,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 22:23:36,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 22:23:36,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 22:23:36,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 22:23:36,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (1/1) ... [2022-01-09 22:23:36,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:23:36,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:36,653 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 22:23:36,655 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 22:23:36,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 22:23:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 22:23:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 22:23:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 22:23:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-09 22:23:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-09 22:23:36,745 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 22:23:36,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 22:23:36,860 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 22:23:36,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 22:23:36,866 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 22:23:36,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:36 BoogieIcfgContainer [2022-01-09 22:23:36,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 22:23:36,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 22:23:36,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 22:23:36,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 22:23:36,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:36" (1/3) ... [2022-01-09 22:23:36,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738eb47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:36, skipping insertion in model container [2022-01-09 22:23:36,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:36" (2/3) ... [2022-01-09 22:23:36,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738eb47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:36, skipping insertion in model container [2022-01-09 22:23:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:36" (3/3) ... [2022-01-09 22:23:36,875 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-01-09 22:23:36,879 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 22:23:36,880 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 22:23:36,943 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 22:23:36,949 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 22:23:36,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 22:23:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-09 22:23:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-09 22:23:37,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:37,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:37,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash -167421905, now seen corresponding path program 1 times [2022-01-09 22:23:37,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:37,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725227691] [2022-01-09 22:23:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:37,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,182 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 22:23:37,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725227691] [2022-01-09 22:23:37,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725227691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:37,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:37,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 22:23:37,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942427916] [2022-01-09 22:23:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:37,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 22:23:37,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 22:23:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 22:23:37,235 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:37,266 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2022-01-09 22:23:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 22:23:37,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-09 22:23:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:37,277 INFO L225 Difference]: With dead ends: 56 [2022-01-09 22:23:37,277 INFO L226 Difference]: Without dead ends: 26 [2022-01-09 22:23:37,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 22:23:37,289 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:37,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-09 22:23:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-09 22:23:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-09 22:23:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-01-09 22:23:37,335 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 11 [2022-01-09 22:23:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:37,335 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-01-09 22:23:37,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-01-09 22:23:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-09 22:23:37,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:37,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:37,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 22:23:37,338 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1482831489, now seen corresponding path program 1 times [2022-01-09 22:23:37,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:37,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678288948] [2022-01-09 22:23:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:37,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,418 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 22:23:37,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:37,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678288948] [2022-01-09 22:23:37,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678288948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:37,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:37,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 22:23:37,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084270887] [2022-01-09 22:23:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:37,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:23:37,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:23:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:23:37,422 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:37,480 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-01-09 22:23:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:23:37,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-09 22:23:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:37,482 INFO L225 Difference]: With dead ends: 32 [2022-01-09 22:23:37,482 INFO L226 Difference]: Without dead ends: 30 [2022-01-09 22:23:37,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:23:37,484 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:37,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 81 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-09 22:23:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-09 22:23:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-09 22:23:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-01-09 22:23:37,494 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 12 [2022-01-09 22:23:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:37,494 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-01-09 22:23:37,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-01-09 22:23:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-09 22:23:37,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:37,495 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:37,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 22:23:37,496 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2126947644, now seen corresponding path program 1 times [2022-01-09 22:23:37,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:37,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657061337] [2022-01-09 22:23:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:37,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-09 22:23:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,636 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 22:23:37,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657061337] [2022-01-09 22:23:37,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657061337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:37,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:37,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 22:23:37,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144236702] [2022-01-09 22:23:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:37,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:23:37,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:23:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:23:37,639 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 22:23:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:37,743 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-01-09 22:23:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 22:23:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-09 22:23:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:37,746 INFO L225 Difference]: With dead ends: 45 [2022-01-09 22:23:37,746 INFO L226 Difference]: Without dead ends: 43 [2022-01-09 22:23:37,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:23:37,747 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:37,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 113 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-09 22:23:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-01-09 22:23:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-09 22:23:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-01-09 22:23:37,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 17 [2022-01-09 22:23:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:37,767 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-01-09 22:23:37,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-09 22:23:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-01-09 22:23:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-09 22:23:37,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:37,769 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:37,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 22:23:37,769 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2018842485, now seen corresponding path program 1 times [2022-01-09 22:23:37,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:37,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322662878] [2022-01-09 22:23:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:37,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 22:23:37,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:37,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322662878] [2022-01-09 22:23:37,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322662878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:37,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:37,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 22:23:37,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132267578] [2022-01-09 22:23:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:37,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:23:37,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:23:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:23:37,890 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 22:23:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:37,977 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-01-09 22:23:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 22:23:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-01-09 22:23:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:37,978 INFO L225 Difference]: With dead ends: 52 [2022-01-09 22:23:37,979 INFO L226 Difference]: Without dead ends: 50 [2022-01-09 22:23:37,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:23:37,980 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:37,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 194 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-09 22:23:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-01-09 22:23:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-09 22:23:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-01-09 22:23:37,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 25 [2022-01-09 22:23:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:37,993 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-01-09 22:23:37,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-09 22:23:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-01-09 22:23:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 22:23:37,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:37,994 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:37,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 22:23:37,994 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1644488141, now seen corresponding path program 1 times [2022-01-09 22:23:37,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214078524] [2022-01-09 22:23:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:37,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-09 22:23:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 22:23:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-09 22:23:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 22:23:38,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214078524] [2022-01-09 22:23:38,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214078524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:38,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:38,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 22:23:38,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337421532] [2022-01-09 22:23:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:38,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 22:23:38,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:38,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 22:23:38,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:23:38,166 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 22:23:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:38,317 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-01-09 22:23:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 22:23:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-01-09 22:23:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:38,319 INFO L225 Difference]: With dead ends: 71 [2022-01-09 22:23:38,319 INFO L226 Difference]: Without dead ends: 64 [2022-01-09 22:23:38,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-09 22:23:38,321 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:38,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 117 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-09 22:23:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-01-09 22:23:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-09 22:23:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-01-09 22:23:38,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2022-01-09 22:23:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:38,333 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-01-09 22:23:38,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 22:23:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-01-09 22:23:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-09 22:23:38,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:38,334 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:38,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 22:23:38,334 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:38,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1722491344, now seen corresponding path program 1 times [2022-01-09 22:23:38,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:38,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000418667] [2022-01-09 22:23:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:38,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 22:23:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 22:23:38,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:38,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000418667] [2022-01-09 22:23:38,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000418667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:38,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:38,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 22:23:38,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774971118] [2022-01-09 22:23:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:38,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 22:23:38,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:38,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 22:23:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:23:38,409 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 22:23:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:38,535 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-01-09 22:23:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 22:23:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-09 22:23:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:38,539 INFO L225 Difference]: With dead ends: 73 [2022-01-09 22:23:38,539 INFO L226 Difference]: Without dead ends: 71 [2022-01-09 22:23:38,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-09 22:23:38,545 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:38,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 166 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-09 22:23:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-01-09 22:23:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-09 22:23:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-01-09 22:23:38,565 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 30 [2022-01-09 22:23:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:38,566 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-01-09 22:23:38,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 22:23:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-01-09 22:23:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-09 22:23:38,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:38,567 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:38,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 22:23:38,567 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1030091550, now seen corresponding path program 1 times [2022-01-09 22:23:38,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:38,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459379685] [2022-01-09 22:23:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:38,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 22:23:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 22:23:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-09 22:23:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-09 22:23:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-09 22:23:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:38,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459379685] [2022-01-09 22:23:38,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459379685] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2269795] [2022-01-09 22:23:38,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:38,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:38,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:23:38,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 22:23:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-09 22:23:38,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:39,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:39,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2269795] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:39,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:39,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-01-09 22:23:39,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443542018] [2022-01-09 22:23:39,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:39,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 22:23:39,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 22:23:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-01-09 22:23:39,486 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-01-09 22:23:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:39,970 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2022-01-09 22:23:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 22:23:39,970 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 53 [2022-01-09 22:23:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:39,972 INFO L225 Difference]: With dead ends: 111 [2022-01-09 22:23:39,972 INFO L226 Difference]: Without dead ends: 96 [2022-01-09 22:23:39,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2022-01-09 22:23:39,974 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:39,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 292 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 22:23:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-09 22:23:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-01-09 22:23:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-09 22:23:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-01-09 22:23:40,001 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 53 [2022-01-09 22:23:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:40,002 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-01-09 22:23:40,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-01-09 22:23:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-01-09 22:23:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-09 22:23:40,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:40,007 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:40,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 22:23:40,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:40,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash 302113055, now seen corresponding path program 1 times [2022-01-09 22:23:40,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468320669] [2022-01-09 22:23:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:40,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 22:23:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 22:23:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-09 22:23:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-09 22:23:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-09 22:23:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:40,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:40,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468320669] [2022-01-09 22:23:40,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468320669] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:40,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549406840] [2022-01-09 22:23:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:40,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:40,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:40,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:23:40,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 22:23:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:40,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 22:23:40,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:40,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-09 22:23:40,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549406840] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:40,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:40,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-01-09 22:23:40,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812343928] [2022-01-09 22:23:40,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:40,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-09 22:23:40,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-09 22:23:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-01-09 22:23:40,732 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-01-09 22:23:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:40,855 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2022-01-09 22:23:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 22:23:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 55 [2022-01-09 22:23:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:40,858 INFO L225 Difference]: With dead ends: 94 [2022-01-09 22:23:40,858 INFO L226 Difference]: Without dead ends: 92 [2022-01-09 22:23:40,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-01-09 22:23:40,859 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:40,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 214 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-09 22:23:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-01-09 22:23:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 61 states have internal predecessors, (63), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-09 22:23:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2022-01-09 22:23:40,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 55 [2022-01-09 22:23:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:40,894 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2022-01-09 22:23:40,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-01-09 22:23:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2022-01-09 22:23:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-09 22:23:40,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:40,899 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 22:23:41,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-09 22:23:41,120 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 847231248, now seen corresponding path program 2 times [2022-01-09 22:23:41,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:41,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76356441] [2022-01-09 22:23:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:41,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 22:23:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 22:23:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-09 22:23:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-09 22:23:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-09 22:23:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 22:23:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 22:23:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-09 22:23:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-09 22:23:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-01-09 22:23:41,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:41,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76356441] [2022-01-09 22:23:41,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76356441] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:41,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528053680] [2022-01-09 22:23:41,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 22:23:41,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:41,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:41,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:23:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 22:23:41,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 22:23:41,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:23:41,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-09 22:23:41,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-09 22:23:41,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-09 22:23:41,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528053680] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:41,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:41,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-09 22:23:41,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873710371] [2022-01-09 22:23:41,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:41,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-09 22:23:41,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:42,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-09 22:23:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-01-09 22:23:42,002 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 11 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2022-01-09 22:23:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:42,697 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2022-01-09 22:23:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-09 22:23:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 11 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 80 [2022-01-09 22:23:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:42,699 INFO L225 Difference]: With dead ends: 109 [2022-01-09 22:23:42,699 INFO L226 Difference]: Without dead ends: 107 [2022-01-09 22:23:42,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=400, Invalid=1580, Unknown=0, NotChecked=0, Total=1980 [2022-01-09 22:23:42,701 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 129 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:42,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 230 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 22:23:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-09 22:23:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2022-01-09 22:23:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 64 states have internal predecessors, (66), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-09 22:23:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-01-09 22:23:42,720 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 80 [2022-01-09 22:23:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:42,720 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-01-09 22:23:42,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 11 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2022-01-09 22:23:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-01-09 22:23:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-09 22:23:42,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:42,727 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:42,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 22:23:42,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:42,946 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1329001986, now seen corresponding path program 2 times [2022-01-09 22:23:42,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441358166] [2022-01-09 22:23:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:42,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-09 22:23:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-09 22:23:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-09 22:23:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-09 22:23:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-09 22:23:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-09 22:23:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-09 22:23:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-09 22:23:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-09 22:23:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-09 22:23:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-09 22:23:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-09 22:23:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-09 22:23:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-09 22:23:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-09 22:23:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 56 proven. 49 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-01-09 22:23:43,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441358166] [2022-01-09 22:23:43,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441358166] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799419687] [2022-01-09 22:23:43,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 22:23:43,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:43,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:23:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 22:23:43,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 22:23:43,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:23:43,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-09 22:23:43,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-01-09 22:23:43,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-01-09 22:23:43,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799419687] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:43,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:43,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 18 [2022-01-09 22:23:43,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917363776] [2022-01-09 22:23:43,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:43,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-09 22:23:43,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-09 22:23:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-09 22:23:43,960 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 10 states have call predecessors, (23), 9 states have call successors, (23) [2022-01-09 22:23:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:44,298 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2022-01-09 22:23:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 22:23:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 10 states have call predecessors, (23), 9 states have call successors, (23) Word has length 103 [2022-01-09 22:23:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:44,299 INFO L225 Difference]: With dead ends: 96 [2022-01-09 22:23:44,299 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 22:23:44,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 226 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-01-09 22:23:44,300 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:44,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 246 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 22:23:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 22:23:44,301 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 22:23:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 22:23:44,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-01-09 22:23:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:44,301 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 22:23:44,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 10 states have call predecessors, (23), 9 states have call successors, (23) [2022-01-09 22:23:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 22:23:44,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 22:23:44,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 22:23:44,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 22:23:44,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:44,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 22:23:45,112 INFO L858 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse1))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2022-01-09 22:23:45,113 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse1))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point L32(lines 25 56) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-09 22:23:45,113 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-01-09 22:23:45,114 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 3 |ULTIMATE.start_main_~inlen~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse2) (let ((.cse3 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse3 |ULTIMATE.start_main_~bufferlen~0#1|) .cse0 (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse3) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) .cse1 .cse2)) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2022-01-09 22:23:45,114 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 3) |ULTIMATE.start_main_~bufferlen~0#1|)) (and (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)))) [2022-01-09 22:23:45,114 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 3) |ULTIMATE.start_main_~bufferlen~0#1|)) (and (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)))) [2022-01-09 22:23:45,114 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2022-01-09 22:23:45,114 INFO L854 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 3 |ULTIMATE.start_main_~inlen~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse2) (let ((.cse3 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse3 |ULTIMATE.start_main_~bufferlen~0#1|) .cse0 (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse3) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) .cse1 .cse2)) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2022-01-09 22:23:45,114 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-01-09 22:23:45,114 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-09 22:23:45,114 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-01-09 22:23:45,114 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|))) [2022-01-09 22:23:45,115 INFO L854 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|))) [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L861 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-01-09 22:23:45,115 INFO L861 garLoopResultBuilder]: At program point L55-1(lines 24 56) the Hoare annotation is: true [2022-01-09 22:23:45,115 INFO L854 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (< 0 (+ |ULTIMATE.start_main_~buflim~0#1| 1)) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|)))) [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-09 22:23:45,115 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-01-09 22:23:45,118 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-01-09 22:23:45,121 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 22:23:45,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:23:45 BoogieIcfgContainer [2022-01-09 22:23:45,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 22:23:45,143 INFO L158 Benchmark]: Toolchain (without parser) took 8770.24ms. Allocated memory was 174.1MB in the beginning and 261.1MB in the end (delta: 87.0MB). Free memory was 153.2MB in the beginning and 199.3MB in the end (delta: -46.1MB). Peak memory consumption was 152.4MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,143 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 22:23:45,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.03ms. Allocated memory was 174.1MB in the beginning and 217.1MB in the end (delta: 43.0MB). Free memory was 153.0MB in the beginning and 194.3MB in the end (delta: -41.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.93ms. Allocated memory is still 217.1MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,144 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 217.1MB. Free memory was 192.7MB in the beginning and 191.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,144 INFO L158 Benchmark]: RCFGBuilder took 255.49ms. Allocated memory is still 217.1MB. Free memory was 191.6MB in the beginning and 181.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,145 INFO L158 Benchmark]: TraceAbstraction took 8273.23ms. Allocated memory was 217.1MB in the beginning and 261.1MB in the end (delta: 44.0MB). Free memory was 180.8MB in the beginning and 199.3MB in the end (delta: -18.5MB). Peak memory consumption was 137.5MB. Max. memory is 8.0GB. [2022-01-09 22:23:45,147 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.11ms. Allocated memory is still 174.1MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.03ms. Allocated memory was 174.1MB in the beginning and 217.1MB in the end (delta: 43.0MB). Free memory was 153.0MB in the beginning and 194.3MB in the end (delta: -41.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.93ms. Allocated memory is still 217.1MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 217.1MB. Free memory was 192.7MB in the beginning and 191.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.49ms. Allocated memory is still 217.1MB. Free memory was 191.6MB in the beginning and 181.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8273.23ms. Allocated memory was 217.1MB in the beginning and 261.1MB in the end (delta: 44.0MB). Free memory was 180.8MB in the beginning and 199.3MB in the end (delta: -18.5MB). Peak memory consumption was 137.5MB. 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: 19]: 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 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 1695 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 356 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 645 SyntacticMatches, 15 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=9, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 57 PreInvPairs, 102 NumberOfFragments, 405 HoareAnnotationTreeSize, 57 FomulaSimplifications, 364 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2214 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 3567 SizeOfPredicates, 16 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2712/2923 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((0 < buflim + 1 && buf == 0) && bufferlen == 2 + buflim) && bufferlen < inlen) && in == 0) || ((((((bufferlen + in + 1 <= buf + inlen && 2 + buflim <= bufferlen) && 1 <= in) && bufferlen <= 2 + buflim) && bufferlen < inlen) && buf + 2 <= bufferlen) && 0 <= buf) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-09 22:23:45,194 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...