/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:31:58,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:31:58,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:31:58,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:31:58,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:31:58,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:31:58,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:31:58,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:31:58,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:31:58,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:31:58,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:31:58,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:31:58,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:31:58,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:31:58,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:31:58,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:31:58,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:31:58,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:31:58,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:31:58,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:31:58,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:31:58,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:31:58,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:31:58,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:31:58,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:31:58,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:31:58,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:31:58,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:31:58,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:31:58,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:31:58,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:31:58,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:31:58,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:31:58,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:31:59,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:31:59,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:31:59,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:31:59,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:31:59,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:31:59,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:31:59,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:31:59,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:31:59,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:31:59,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:31:59,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:31:59,044 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:31:59,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:31:59,045 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:31:59,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:31:59,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:31:59,046 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:31:59,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:31:59,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:31:59,047 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:31:59,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:31:59,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:31:59,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:31:59,048 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:31:59,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:31:59,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:31:59,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:31:59,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:31:59,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:31:59,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:31:59,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:31:59,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:31:59,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:31:59,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:31:59,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:31:59,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:31:59,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:31:59,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:31:59,054 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 [2022-10-15 16:31:59,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:31:59,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:31:59,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:31:59,556 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:31:59,557 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:31:59,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2022-10-15 16:31:59,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89c3599b/447f59f4e8574a5cb853ec0518012ef2/FLAG2f5810c35 [2022-10-15 16:32:00,365 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:32:00,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2022-10-15 16:32:00,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89c3599b/447f59f4e8574a5cb853ec0518012ef2/FLAG2f5810c35 [2022-10-15 16:32:00,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89c3599b/447f59f4e8574a5cb853ec0518012ef2 [2022-10-15 16:32:00,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:32:00,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:32:00,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:32:00,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:32:00,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:32:00,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:32:00" (1/1) ... [2022-10-15 16:32:00,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efb5313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:00, skipping insertion in model container [2022-10-15 16:32:00,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:32:00" (1/1) ... [2022-10-15 16:32:00,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:32:00,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:32:00,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c[816,829] [2022-10-15 16:32:01,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:32:01,062 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:32:01,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c[816,829] [2022-10-15 16:32:01,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:32:01,178 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:32:01,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01 WrapperNode [2022-10-15 16:32:01,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:32:01,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:32:01,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:32:01,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:32:01,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,246 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 216 [2022-10-15 16:32:01,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:32:01,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:32:01,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:32:01,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:32:01,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:32:01,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:32:01,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:32:01,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:32:01,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (1/1) ... [2022-10-15 16:32:01,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:32:01,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:01,354 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-10-15 16:32:01,375 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-10-15 16:32:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:32:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:32:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-10-15 16:32:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-10-15 16:32:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:32:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:32:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-10-15 16:32:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-10-15 16:32:01,662 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:32:01,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:32:02,487 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:32:02,507 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:32:02,508 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:32:02,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:32:02 BoogieIcfgContainer [2022-10-15 16:32:02,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:32:02,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:32:02,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:32:02,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:32:02,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:32:00" (1/3) ... [2022-10-15 16:32:02,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7983aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:32:02, skipping insertion in model container [2022-10-15 16:32:02,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:32:01" (2/3) ... [2022-10-15 16:32:02,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7983aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:32:02, skipping insertion in model container [2022-10-15 16:32:02,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:32:02" (3/3) ... [2022-10-15 16:32:02,533 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2022-10-15 16:32:02,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:32:02,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 16:32:02,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:32:02,656 INFO L357 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14b83190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:32:02,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 16:32:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 98 states have internal predecessors, (163), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:32:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 16:32:02,682 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:02,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:02,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 175594485, now seen corresponding path program 1 times [2022-10-15 16:32:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:02,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795848742] [2022-10-15 16:32:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795848742] [2022-10-15 16:32:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795848742] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:03,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:03,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:32:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530988762] [2022-10-15 16:32:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:03,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:03,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:03,258 INFO L87 Difference]: Start difference. First operand has 107 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 98 states have internal predecessors, (163), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:03,359 INFO L93 Difference]: Finished difference Result 114 states and 173 transitions. [2022-10-15 16:32:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-10-15 16:32:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:03,380 INFO L225 Difference]: With dead ends: 114 [2022-10-15 16:32:03,380 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:32:03,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:03,387 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 125 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:03,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 305 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:32:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2022-10-15 16:32:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 93 states have internal predecessors, (139), 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-10-15 16:32:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 154 transitions. [2022-10-15 16:32:03,444 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 154 transitions. Word has length 35 [2022-10-15 16:32:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:03,445 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 154 transitions. [2022-10-15 16:32:03,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 154 transitions. [2022-10-15 16:32:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:32:03,449 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:03,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:03,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:32:03,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1832413933, now seen corresponding path program 1 times [2022-10-15 16:32:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:03,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817155402] [2022-10-15 16:32:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:03,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817155402] [2022-10-15 16:32:03,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817155402] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:03,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:03,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047427088] [2022-10-15 16:32:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:03,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:03,669 INFO L87 Difference]: Start difference. First operand 102 states and 154 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:03,759 INFO L93 Difference]: Finished difference Result 165 states and 249 transitions. [2022-10-15 16:32:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-10-15 16:32:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:03,764 INFO L225 Difference]: With dead ends: 165 [2022-10-15 16:32:03,765 INFO L226 Difference]: Without dead ends: 165 [2022-10-15 16:32:03,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:03,767 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 107 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:03,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 448 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-10-15 16:32:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2022-10-15 16:32:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.492537313432836) internal successors, (200), 136 states have internal predecessors, (200), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-10-15 16:32:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 219 transitions. [2022-10-15 16:32:03,804 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 219 transitions. Word has length 37 [2022-10-15 16:32:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:03,804 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 219 transitions. [2022-10-15 16:32:03,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 219 transitions. [2022-10-15 16:32:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:32:03,814 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:03,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:32:03,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1252089056, now seen corresponding path program 1 times [2022-10-15 16:32:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:03,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317371611] [2022-10-15 16:32:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317371611] [2022-10-15 16:32:04,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317371611] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:04,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:04,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887597088] [2022-10-15 16:32:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:04,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:04,066 INFO L87 Difference]: Start difference. First operand 147 states and 219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:04,176 INFO L93 Difference]: Finished difference Result 250 states and 371 transitions. [2022-10-15 16:32:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-10-15 16:32:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:04,182 INFO L225 Difference]: With dead ends: 250 [2022-10-15 16:32:04,182 INFO L226 Difference]: Without dead ends: 236 [2022-10-15 16:32:04,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:04,205 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 103 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:04,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 451 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-10-15 16:32:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2022-10-15 16:32:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.4504950495049505) internal successors, (293), 205 states have internal predecessors, (293), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-15 16:32:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 319 transitions. [2022-10-15 16:32:04,239 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 319 transitions. Word has length 39 [2022-10-15 16:32:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:04,239 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 319 transitions. [2022-10-15 16:32:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 319 transitions. [2022-10-15 16:32:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:32:04,243 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:04,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:32:04,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2080035882, now seen corresponding path program 1 times [2022-10-15 16:32:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:04,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131633985] [2022-10-15 16:32:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:04,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131633985] [2022-10-15 16:32:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131633985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:04,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:04,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476625701] [2022-10-15 16:32:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:04,464 INFO L87 Difference]: Start difference. First operand 219 states and 319 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:04,614 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2022-10-15 16:32:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-15 16:32:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:04,621 INFO L225 Difference]: With dead ends: 335 [2022-10-15 16:32:04,621 INFO L226 Difference]: Without dead ends: 321 [2022-10-15 16:32:04,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-10-15 16:32:04,625 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 208 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:04,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 668 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-10-15 16:32:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-10-15 16:32:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 252 states have (on average 1.4523809523809523) internal successors, (366), 256 states have internal predecessors, (366), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-10-15 16:32:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 400 transitions. [2022-10-15 16:32:04,653 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 400 transitions. Word has length 40 [2022-10-15 16:32:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:04,655 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 400 transitions. [2022-10-15 16:32:04,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 400 transitions. [2022-10-15 16:32:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:32:04,663 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:04,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:04,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:32:04,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1193863060, now seen corresponding path program 1 times [2022-10-15 16:32:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:04,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040620294] [2022-10-15 16:32:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040620294] [2022-10-15 16:32:04,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040620294] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:04,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:04,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785859601] [2022-10-15 16:32:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:04,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:04,748 INFO L87 Difference]: Start difference. First operand 273 states and 400 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:04,797 INFO L93 Difference]: Finished difference Result 287 states and 423 transitions. [2022-10-15 16:32:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-15 16:32:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:04,802 INFO L225 Difference]: With dead ends: 287 [2022-10-15 16:32:04,803 INFO L226 Difference]: Without dead ends: 287 [2022-10-15 16:32:04,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:04,816 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 45 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:04,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 402 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-10-15 16:32:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-10-15 16:32:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 253 states have (on average 1.4505928853754941) internal successors, (367), 257 states have internal predecessors, (367), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-10-15 16:32:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2022-10-15 16:32:04,864 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 40 [2022-10-15 16:32:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:04,865 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-10-15 16:32:04,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2022-10-15 16:32:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 16:32:04,874 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:04,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:04,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:32:04,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1843010355, now seen corresponding path program 1 times [2022-10-15 16:32:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171227867] [2022-10-15 16:32:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171227867] [2022-10-15 16:32:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171227867] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:05,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757616711] [2022-10-15 16:32:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:05,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:05,449 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-10-15 16:32:05,455 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-10-15 16:32:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:05,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 16:32:05,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:32:05,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757616711] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:05,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:05,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2022-10-15 16:32:05,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228696515] [2022-10-15 16:32:05,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:05,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 16:32:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 16:32:06,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:06,003 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:32:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,035 INFO L93 Difference]: Finished difference Result 290 states and 438 transitions. [2022-10-15 16:32:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-15 16:32:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-10-15 16:32:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,038 INFO L225 Difference]: With dead ends: 290 [2022-10-15 16:32:07,039 INFO L226 Difference]: Without dead ends: 290 [2022-10-15 16:32:07,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:32:07,041 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 470 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 3304 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:32:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-10-15 16:32:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2022-10-15 16:32:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 158 states have internal predecessors, (222), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-10-15 16:32:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 253 transitions. [2022-10-15 16:32:07,059 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 253 transitions. Word has length 41 [2022-10-15 16:32:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,060 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 253 transitions. [2022-10-15 16:32:07,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:32:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2022-10-15 16:32:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 16:32:07,063 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:07,105 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-10-15 16:32:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:32:07,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1327803845, now seen corresponding path program 1 times [2022-10-15 16:32:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362357567] [2022-10-15 16:32:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362357567] [2022-10-15 16:32:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362357567] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:07,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:07,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919657649] [2022-10-15 16:32:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:07,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:07,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:07,397 INFO L87 Difference]: Start difference. First operand 173 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,466 INFO L93 Difference]: Finished difference Result 179 states and 262 transitions. [2022-10-15 16:32:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-10-15 16:32:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,469 INFO L225 Difference]: With dead ends: 179 [2022-10-15 16:32:07,470 INFO L226 Difference]: Without dead ends: 179 [2022-10-15 16:32:07,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 16:32:07,471 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 176 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 530 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-15 16:32:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2022-10-15 16:32:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 147 states have (on average 1.4149659863945578) internal successors, (208), 149 states have internal predecessors, (208), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2022-10-15 16:32:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2022-10-15 16:32:07,482 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 43 [2022-10-15 16:32:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,482 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2022-10-15 16:32:07,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2022-10-15 16:32:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 16:32:07,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:32:07,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 950062186, now seen corresponding path program 1 times [2022-10-15 16:32:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410239447] [2022-10-15 16:32:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410239447] [2022-10-15 16:32:07,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410239447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:07,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:07,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:32:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677342242] [2022-10-15 16:32:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:07,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:07,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:07,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:07,597 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:07,665 INFO L93 Difference]: Finished difference Result 176 states and 253 transitions. [2022-10-15 16:32:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-10-15 16:32:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:07,668 INFO L225 Difference]: With dead ends: 176 [2022-10-15 16:32:07,668 INFO L226 Difference]: Without dead ends: 171 [2022-10-15 16:32:07,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:07,669 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 42 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:07,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 679 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-10-15 16:32:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2022-10-15 16:32:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 146 states have (on average 1.404109589041096) internal successors, (205), 148 states have internal predecessors, (205), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2022-10-15 16:32:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 232 transitions. [2022-10-15 16:32:07,679 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 232 transitions. Word has length 44 [2022-10-15 16:32:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:07,680 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 232 transitions. [2022-10-15 16:32:07,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 232 transitions. [2022-10-15 16:32:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:32:07,682 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:07,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:32:07,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2025032094, now seen corresponding path program 1 times [2022-10-15 16:32:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914211784] [2022-10-15 16:32:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:07,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914211784] [2022-10-15 16:32:07,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914211784] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495719016] [2022-10-15 16:32:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:07,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:07,971 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-10-15 16:32:07,987 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-10-15 16:32:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 16:32:08,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:32:08,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495719016] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:08,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:32:08,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 17 [2022-10-15 16:32:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187934540] [2022-10-15 16:32:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:08,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:08,298 INFO L87 Difference]: Start difference. First operand 162 states and 232 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:08,407 INFO L93 Difference]: Finished difference Result 280 states and 396 transitions. [2022-10-15 16:32:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-10-15 16:32:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:08,410 INFO L225 Difference]: With dead ends: 280 [2022-10-15 16:32:08,410 INFO L226 Difference]: Without dead ends: 280 [2022-10-15 16:32:08,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:08,412 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 86 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:08,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 698 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-10-15 16:32:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-10-15 16:32:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 254 states have (on average 1.3858267716535433) internal successors, (352), 255 states have internal predecessors, (352), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2022-10-15 16:32:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 391 transitions. [2022-10-15 16:32:08,425 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 391 transitions. Word has length 45 [2022-10-15 16:32:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:08,426 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 391 transitions. [2022-10-15 16:32:08,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 391 transitions. [2022-10-15 16:32:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:32:08,428 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:08,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:08,470 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-10-15 16:32:08,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 16:32:08,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1258817952, now seen corresponding path program 1 times [2022-10-15 16:32:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:08,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23172311] [2022-10-15 16:32:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23172311] [2022-10-15 16:32:08,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23172311] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:08,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:08,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744112140] [2022-10-15 16:32:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:08,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:08,734 INFO L87 Difference]: Start difference. First operand 276 states and 391 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:08,805 INFO L93 Difference]: Finished difference Result 382 states and 540 transitions. [2022-10-15 16:32:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-10-15 16:32:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:08,809 INFO L225 Difference]: With dead ends: 382 [2022-10-15 16:32:08,810 INFO L226 Difference]: Without dead ends: 382 [2022-10-15 16:32:08,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 16:32:08,811 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 188 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:08,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 537 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-10-15 16:32:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 311. [2022-10-15 16:32:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 289 states have (on average 1.3806228373702423) internal successors, (399), 289 states have internal predecessors, (399), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2022-10-15 16:32:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 438 transitions. [2022-10-15 16:32:08,828 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 438 transitions. Word has length 45 [2022-10-15 16:32:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:08,829 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 438 transitions. [2022-10-15 16:32:08,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 438 transitions. [2022-10-15 16:32:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:08,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:08,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:08,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:32:08,831 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 263621655, now seen corresponding path program 1 times [2022-10-15 16:32:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:08,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517032179] [2022-10-15 16:32:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517032179] [2022-10-15 16:32:08,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517032179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:08,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:08,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461593285] [2022-10-15 16:32:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:08,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:08,909 INFO L87 Difference]: Start difference. First operand 311 states and 438 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:08,960 INFO L93 Difference]: Finished difference Result 323 states and 454 transitions. [2022-10-15 16:32:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:08,963 INFO L225 Difference]: With dead ends: 323 [2022-10-15 16:32:08,963 INFO L226 Difference]: Without dead ends: 319 [2022-10-15 16:32:08,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 16:32:08,965 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 38 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:08,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 528 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-10-15 16:32:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2022-10-15 16:32:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 289 states have (on average 1.3737024221453287) internal successors, (397), 289 states have internal predecessors, (397), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2022-10-15 16:32:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 436 transitions. [2022-10-15 16:32:08,978 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 436 transitions. Word has length 48 [2022-10-15 16:32:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:08,979 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 436 transitions. [2022-10-15 16:32:08,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-10-15 16:32:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:08,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:08,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:08,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:32:08,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash -437442923, now seen corresponding path program 1 times [2022-10-15 16:32:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:08,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479160871] [2022-10-15 16:32:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479160871] [2022-10-15 16:32:09,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479160871] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307235993] [2022-10-15 16:32:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:09,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:09,305 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-10-15 16:32:09,330 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-10-15 16:32:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:32:09,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:09,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307235993] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:09,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:09,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-10-15 16:32:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600773509] [2022-10-15 16:32:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:09,463 INFO L87 Difference]: Start difference. First operand 311 states and 436 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:09,640 INFO L93 Difference]: Finished difference Result 577 states and 801 transitions. [2022-10-15 16:32:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:09,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:09,644 INFO L225 Difference]: With dead ends: 577 [2022-10-15 16:32:09,645 INFO L226 Difference]: Without dead ends: 551 [2022-10-15 16:32:09,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:09,646 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 145 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:09,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 714 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-10-15 16:32:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 443. [2022-10-15 16:32:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 414 states have (on average 1.3429951690821256) internal successors, (556), 415 states have internal predecessors, (556), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (28), 25 states have call predecessors, (28), 22 states have call successors, (28) [2022-10-15 16:32:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 608 transitions. [2022-10-15 16:32:09,665 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 608 transitions. Word has length 48 [2022-10-15 16:32:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:09,665 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 608 transitions. [2022-10-15 16:32:09,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 608 transitions. [2022-10-15 16:32:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:09,667 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:09,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:09,708 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-10-15 16:32:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:09,882 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1883998399, now seen corresponding path program 1 times [2022-10-15 16:32:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017479655] [2022-10-15 16:32:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:09,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017479655] [2022-10-15 16:32:09,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017479655] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:09,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:09,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409365656] [2022-10-15 16:32:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:09,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:09,965 INFO L87 Difference]: Start difference. First operand 443 states and 608 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:10,043 INFO L93 Difference]: Finished difference Result 574 states and 761 transitions. [2022-10-15 16:32:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-10-15 16:32:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:10,048 INFO L225 Difference]: With dead ends: 574 [2022-10-15 16:32:10,048 INFO L226 Difference]: Without dead ends: 524 [2022-10-15 16:32:10,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:10,049 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 75 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:10,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-10-15 16:32:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2022-10-15 16:32:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 419 states have (on average 1.3150357995226731) internal successors, (551), 420 states have internal predecessors, (551), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (28), 25 states have call predecessors, (28), 22 states have call successors, (28) [2022-10-15 16:32:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 603 transitions. [2022-10-15 16:32:10,067 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 603 transitions. Word has length 48 [2022-10-15 16:32:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:10,067 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 603 transitions. [2022-10-15 16:32:10,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 603 transitions. [2022-10-15 16:32:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 16:32:10,069 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:10,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:32:10,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1556701783, now seen corresponding path program 1 times [2022-10-15 16:32:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:10,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680377249] [2022-10-15 16:32:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:10,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680377249] [2022-10-15 16:32:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680377249] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:10,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:10,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:32:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542993787] [2022-10-15 16:32:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:10,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:10,370 INFO L87 Difference]: Start difference. First operand 448 states and 603 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:10,645 INFO L93 Difference]: Finished difference Result 543 states and 729 transitions. [2022-10-15 16:32:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:32:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-10-15 16:32:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:10,650 INFO L225 Difference]: With dead ends: 543 [2022-10-15 16:32:10,650 INFO L226 Difference]: Without dead ends: 533 [2022-10-15 16:32:10,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:32:10,651 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 123 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:10,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1659 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-15 16:32:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 445. [2022-10-15 16:32:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 416 states have (on average 1.3173076923076923) internal successors, (548), 418 states have internal predecessors, (548), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (26), 24 states have call predecessors, (26), 22 states have call successors, (26) [2022-10-15 16:32:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 598 transitions. [2022-10-15 16:32:10,668 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 598 transitions. Word has length 48 [2022-10-15 16:32:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:10,669 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 598 transitions. [2022-10-15 16:32:10,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 598 transitions. [2022-10-15 16:32:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-15 16:32:10,671 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:10,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:10,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:32:10,671 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1949800431, now seen corresponding path program 1 times [2022-10-15 16:32:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:10,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552478353] [2022-10-15 16:32:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552478353] [2022-10-15 16:32:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552478353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427724537] [2022-10-15 16:32:10,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:10,886 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-10-15 16:32:10,909 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-10-15 16:32:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:10,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:32:10,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:11,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:11,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427724537] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:11,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:11,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-10-15 16:32:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490438769] [2022-10-15 16:32:11,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:11,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:32:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:32:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:11,177 INFO L87 Difference]: Start difference. First operand 445 states and 598 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:11,880 INFO L93 Difference]: Finished difference Result 840 states and 1098 transitions. [2022-10-15 16:32:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-10-15 16:32:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:11,885 INFO L225 Difference]: With dead ends: 840 [2022-10-15 16:32:11,885 INFO L226 Difference]: Without dead ends: 808 [2022-10-15 16:32:11,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:32:11,887 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 566 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:11,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2188 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:32:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-10-15 16:32:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 644. [2022-10-15 16:32:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 603 states have (on average 1.2703150912106136) internal successors, (766), 606 states have internal predecessors, (766), 35 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (42), 36 states have call predecessors, (42), 32 states have call successors, (42) [2022-10-15 16:32:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 843 transitions. [2022-10-15 16:32:11,913 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 843 transitions. Word has length 49 [2022-10-15 16:32:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:11,914 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 843 transitions. [2022-10-15 16:32:11,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 843 transitions. [2022-10-15 16:32:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 16:32:11,916 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:11,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:11,958 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-10-15 16:32:12,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 16:32:12,131 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1279251222, now seen corresponding path program 1 times [2022-10-15 16:32:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:12,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014670382] [2022-10-15 16:32:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:32:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:12,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014670382] [2022-10-15 16:32:12,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014670382] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:12,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187459818] [2022-10-15 16:32:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:12,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:12,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:12,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:32:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:12,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:32:12,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:13,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187459818] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:13,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:13,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2022-10-15 16:32:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072723500] [2022-10-15 16:32:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-10-15 16:32:13,143 INFO L87 Difference]: Start difference. First operand 644 states and 843 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:13,419 INFO L93 Difference]: Finished difference Result 823 states and 1083 transitions. [2022-10-15 16:32:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-10-15 16:32:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:13,425 INFO L225 Difference]: With dead ends: 823 [2022-10-15 16:32:13,425 INFO L226 Difference]: Without dead ends: 823 [2022-10-15 16:32:13,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:32:13,427 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 298 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:13,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 998 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-10-15 16:32:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 673. [2022-10-15 16:32:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 630 states have (on average 1.265079365079365) internal successors, (797), 634 states have internal predecessors, (797), 37 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (44), 38 states have call predecessors, (44), 34 states have call successors, (44) [2022-10-15 16:32:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 878 transitions. [2022-10-15 16:32:13,453 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 878 transitions. Word has length 50 [2022-10-15 16:32:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:13,453 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 878 transitions. [2022-10-15 16:32:13,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 878 transitions. [2022-10-15 16:32:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 16:32:13,456 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:13,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:13,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:13,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 16:32:13,672 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1367661143, now seen corresponding path program 1 times [2022-10-15 16:32:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197035592] [2022-10-15 16:32:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 16:32:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197035592] [2022-10-15 16:32:13,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197035592] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:13,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:13,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017992744] [2022-10-15 16:32:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:13,789 INFO L87 Difference]: Start difference. First operand 673 states and 878 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:13,883 INFO L93 Difference]: Finished difference Result 724 states and 949 transitions. [2022-10-15 16:32:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:13,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-10-15 16:32:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:13,888 INFO L225 Difference]: With dead ends: 724 [2022-10-15 16:32:13,888 INFO L226 Difference]: Without dead ends: 724 [2022-10-15 16:32:13,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:13,889 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 78 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:13,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 841 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-10-15 16:32:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 682. [2022-10-15 16:32:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 635 states have (on average 1.262992125984252) internal successors, (802), 642 states have internal predecessors, (802), 40 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (47), 38 states have call predecessors, (47), 37 states have call successors, (47) [2022-10-15 16:32:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 889 transitions. [2022-10-15 16:32:13,910 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 889 transitions. Word has length 51 [2022-10-15 16:32:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:13,910 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 889 transitions. [2022-10-15 16:32:13,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 889 transitions. [2022-10-15 16:32:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 16:32:13,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:13,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:13,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:32:13,913 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1531138554, now seen corresponding path program 1 times [2022-10-15 16:32:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212217945] [2022-10-15 16:32:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 16:32:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212217945] [2022-10-15 16:32:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212217945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:13,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:13,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:32:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107590485] [2022-10-15 16:32:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:13,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:32:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:32:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:13,983 INFO L87 Difference]: Start difference. First operand 682 states and 889 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:14,029 INFO L93 Difference]: Finished difference Result 692 states and 905 transitions. [2022-10-15 16:32:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-10-15 16:32:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:14,034 INFO L225 Difference]: With dead ends: 692 [2022-10-15 16:32:14,034 INFO L226 Difference]: Without dead ends: 673 [2022-10-15 16:32:14,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 16:32:14,036 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:14,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-10-15 16:32:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 567. [2022-10-15 16:32:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 525 states have (on average 1.2704761904761905) internal successors, (667), 531 states have internal predecessors, (667), 35 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (42), 33 states have call predecessors, (42), 32 states have call successors, (42) [2022-10-15 16:32:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 744 transitions. [2022-10-15 16:32:14,055 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 744 transitions. Word has length 52 [2022-10-15 16:32:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:14,055 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 744 transitions. [2022-10-15 16:32:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 744 transitions. [2022-10-15 16:32:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 16:32:14,058 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:14,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:14,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:32:14,058 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 613706947, now seen corresponding path program 1 times [2022-10-15 16:32:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:14,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293610309] [2022-10-15 16:32:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-15 16:32:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293610309] [2022-10-15 16:32:14,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293610309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:14,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:14,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:32:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337609687] [2022-10-15 16:32:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:14,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:14,283 INFO L87 Difference]: Start difference. First operand 567 states and 744 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:14,536 INFO L93 Difference]: Finished difference Result 1049 states and 1374 transitions. [2022-10-15 16:32:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:14,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-10-15 16:32:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:14,545 INFO L225 Difference]: With dead ends: 1049 [2022-10-15 16:32:14,545 INFO L226 Difference]: Without dead ends: 1047 [2022-10-15 16:32:14,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:14,546 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 186 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:14,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1336 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-10-15 16:32:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 916. [2022-10-15 16:32:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 856 states have (on average 1.2593457943925233) internal successors, (1078), 863 states have internal predecessors, (1078), 53 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (60), 52 states have call predecessors, (60), 50 states have call successors, (60) [2022-10-15 16:32:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1191 transitions. [2022-10-15 16:32:14,580 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1191 transitions. Word has length 57 [2022-10-15 16:32:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:14,580 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1191 transitions. [2022-10-15 16:32:14,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1191 transitions. [2022-10-15 16:32:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:14,583 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:14,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:14,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 16:32:14,583 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 97985437, now seen corresponding path program 1 times [2022-10-15 16:32:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:14,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410030674] [2022-10-15 16:32:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410030674] [2022-10-15 16:32:14,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410030674] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748283897] [2022-10-15 16:32:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:14,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:14,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 16:32:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:14,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:32:14,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:14,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:15,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748283897] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:15,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-10-15 16:32:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459205048] [2022-10-15 16:32:15,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:15,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:32:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:15,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:32:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:15,011 INFO L87 Difference]: Start difference. First operand 916 states and 1191 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:15,314 INFO L93 Difference]: Finished difference Result 1547 states and 2020 transitions. [2022-10-15 16:32:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:32:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-10-15 16:32:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:15,324 INFO L225 Difference]: With dead ends: 1547 [2022-10-15 16:32:15,325 INFO L226 Difference]: Without dead ends: 1543 [2022-10-15 16:32:15,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:15,326 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 174 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:15,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 3088 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-10-15 16:32:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 928. [2022-10-15 16:32:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 868 states have (on average 1.2580645161290323) internal successors, (1092), 875 states have internal predecessors, (1092), 53 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (60), 52 states have call predecessors, (60), 50 states have call successors, (60) [2022-10-15 16:32:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1205 transitions. [2022-10-15 16:32:15,365 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1205 transitions. Word has length 58 [2022-10-15 16:32:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:15,365 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1205 transitions. [2022-10-15 16:32:15,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1205 transitions. [2022-10-15 16:32:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:15,367 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:15,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:15,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:15,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:15,581 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash 231998943, now seen corresponding path program 1 times [2022-10-15 16:32:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:15,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874367287] [2022-10-15 16:32:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:32:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:15,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874367287] [2022-10-15 16:32:15,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874367287] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:15,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612490132] [2022-10-15 16:32:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:15,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:15,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:32:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:32:15,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:15,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:16,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612490132] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:16,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:16,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-15 16:32:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787889803] [2022-10-15 16:32:16,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:16,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-15 16:32:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-15 16:32:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:32:16,066 INFO L87 Difference]: Start difference. First operand 928 states and 1205 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:16,414 INFO L93 Difference]: Finished difference Result 2068 states and 2750 transitions. [2022-10-15 16:32:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:32:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-10-15 16:32:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:16,427 INFO L225 Difference]: With dead ends: 2068 [2022-10-15 16:32:16,427 INFO L226 Difference]: Without dead ends: 2046 [2022-10-15 16:32:16,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:32:16,428 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 274 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:16,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 2490 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-10-15 16:32:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 908. [2022-10-15 16:32:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 849 states have (on average 1.2614840989399294) internal successors, (1071), 858 states have internal predecessors, (1071), 52 states have call successors, (52), 4 states have call predecessors, (52), 6 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2022-10-15 16:32:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1179 transitions. [2022-10-15 16:32:16,470 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1179 transitions. Word has length 58 [2022-10-15 16:32:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:16,470 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1179 transitions. [2022-10-15 16:32:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 16:32:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1179 transitions. [2022-10-15 16:32:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:32:16,473 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:16,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:16,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:16,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:16,686 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1656498653, now seen corresponding path program 1 times [2022-10-15 16:32:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:16,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428586435] [2022-10-15 16:32:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:16,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:32:16,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:16,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428586435] [2022-10-15 16:32:16,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428586435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:16,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:16,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:32:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057374134] [2022-10-15 16:32:16,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:16,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:32:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:32:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:32:16,830 INFO L87 Difference]: Start difference. First operand 908 states and 1179 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:16,973 INFO L93 Difference]: Finished difference Result 789 states and 1021 transitions. [2022-10-15 16:32:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-10-15 16:32:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:16,978 INFO L225 Difference]: With dead ends: 789 [2022-10-15 16:32:16,979 INFO L226 Difference]: Without dead ends: 752 [2022-10-15 16:32:16,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:16,980 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 44 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:16,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 869 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-10-15 16:32:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2022-10-15 16:32:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 692 states have (on average 1.2658959537572254) internal successors, (876), 702 states have internal predecessors, (876), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (46), 41 states have call predecessors, (46), 43 states have call successors, (46) [2022-10-15 16:32:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 968 transitions. [2022-10-15 16:32:17,004 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 968 transitions. Word has length 58 [2022-10-15 16:32:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:17,004 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 968 transitions. [2022-10-15 16:32:17,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 968 transitions. [2022-10-15 16:32:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-15 16:32:17,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:17,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:17,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 16:32:17,007 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2050091172, now seen corresponding path program 1 times [2022-10-15 16:32:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:17,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157173625] [2022-10-15 16:32:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-15 16:32:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157173625] [2022-10-15 16:32:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157173625] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:17,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:32:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21851849] [2022-10-15 16:32:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:32:17,098 INFO L87 Difference]: Start difference. First operand 744 states and 968 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:17,178 INFO L93 Difference]: Finished difference Result 764 states and 1001 transitions. [2022-10-15 16:32:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-10-15 16:32:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:17,184 INFO L225 Difference]: With dead ends: 764 [2022-10-15 16:32:17,184 INFO L226 Difference]: Without dead ends: 764 [2022-10-15 16:32:17,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:17,185 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 55 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:17,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 355 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-10-15 16:32:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 745. [2022-10-15 16:32:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 693 states have (on average 1.2655122655122655) internal successors, (877), 703 states have internal predecessors, (877), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (46), 41 states have call predecessors, (46), 43 states have call successors, (46) [2022-10-15 16:32:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 969 transitions. [2022-10-15 16:32:17,210 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 969 transitions. Word has length 59 [2022-10-15 16:32:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:17,211 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 969 transitions. [2022-10-15 16:32:17,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 969 transitions. [2022-10-15 16:32:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 16:32:17,236 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:17,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:17,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 16:32:17,237 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1673881831, now seen corresponding path program 1 times [2022-10-15 16:32:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:17,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335387928] [2022-10-15 16:32:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335387928] [2022-10-15 16:32:17,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335387928] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170120660] [2022-10-15 16:32:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:17,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:17,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 16:32:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:17,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-15 16:32:17,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:18,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:18,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170120660] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:18,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:32:18,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 26 [2022-10-15 16:32:18,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419974760] [2022-10-15 16:32:18,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:18,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-10-15 16:32:18,550 INFO L87 Difference]: Start difference. First operand 745 states and 969 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,058 INFO L93 Difference]: Finished difference Result 1159 states and 1504 transitions. [2022-10-15 16:32:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:32:19,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-10-15 16:32:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,065 INFO L225 Difference]: With dead ends: 1159 [2022-10-15 16:32:19,065 INFO L226 Difference]: Without dead ends: 1147 [2022-10-15 16:32:19,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-10-15 16:32:19,066 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 254 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1684 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:32:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-10-15 16:32:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1000. [2022-10-15 16:32:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 930 states have (on average 1.270967741935484) internal successors, (1182), 941 states have internal predecessors, (1182), 63 states have call successors, (63), 4 states have call predecessors, (63), 6 states have return successors, (66), 59 states have call predecessors, (66), 60 states have call successors, (66) [2022-10-15 16:32:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1311 transitions. [2022-10-15 16:32:19,100 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1311 transitions. Word has length 60 [2022-10-15 16:32:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,100 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1311 transitions. [2022-10-15 16:32:19,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1311 transitions. [2022-10-15 16:32:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:19,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:19,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:19,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-10-15 16:32:19,318 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1123549791, now seen corresponding path program 1 times [2022-10-15 16:32:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338441546] [2022-10-15 16:32:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:19,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338441546] [2022-10-15 16:32:19,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338441546] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:19,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:19,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140138189] [2022-10-15 16:32:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:19,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:19,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:19,469 INFO L87 Difference]: Start difference. First operand 1000 states and 1311 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,566 INFO L93 Difference]: Finished difference Result 1036 states and 1357 transitions. [2022-10-15 16:32:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-10-15 16:32:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,572 INFO L225 Difference]: With dead ends: 1036 [2022-10-15 16:32:19,572 INFO L226 Difference]: Without dead ends: 1034 [2022-10-15 16:32:19,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:19,574 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 63 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 828 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-10-15 16:32:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 995. [2022-10-15 16:32:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 924 states have (on average 1.2705627705627707) internal successors, (1174), 937 states have internal predecessors, (1174), 63 states have call successors, (63), 5 states have call predecessors, (63), 7 states have return successors, (66), 57 states have call predecessors, (66), 60 states have call successors, (66) [2022-10-15 16:32:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1303 transitions. [2022-10-15 16:32:19,619 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1303 transitions. Word has length 62 [2022-10-15 16:32:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,620 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1303 transitions. [2022-10-15 16:32:19,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1303 transitions. [2022-10-15 16:32:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:19,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-15 16:32:19,624 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1180808093, now seen corresponding path program 1 times [2022-10-15 16:32:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69057982] [2022-10-15 16:32:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-15 16:32:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69057982] [2022-10-15 16:32:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69057982] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:19,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:32:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040943127] [2022-10-15 16:32:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:19,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:32:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:32:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:19,791 INFO L87 Difference]: Start difference. First operand 995 states and 1303 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:19,884 INFO L93 Difference]: Finished difference Result 1026 states and 1342 transitions. [2022-10-15 16:32:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:32:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-10-15 16:32:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:19,890 INFO L225 Difference]: With dead ends: 1026 [2022-10-15 16:32:19,890 INFO L226 Difference]: Without dead ends: 1014 [2022-10-15 16:32:19,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:19,892 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:19,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 824 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-10-15 16:32:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 980. [2022-10-15 16:32:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 912 states have (on average 1.2653508771929824) internal successors, (1154), 923 states have internal predecessors, (1154), 60 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2022-10-15 16:32:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1276 transitions. [2022-10-15 16:32:19,919 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1276 transitions. Word has length 62 [2022-10-15 16:32:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:19,919 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1276 transitions. [2022-10-15 16:32:19,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:32:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1276 transitions. [2022-10-15 16:32:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:19,921 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:19,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 16:32:19,922 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1203945012, now seen corresponding path program 1 times [2022-10-15 16:32:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202416998] [2022-10-15 16:32:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 16:32:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:20,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202416998] [2022-10-15 16:32:20,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202416998] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167369332] [2022-10-15 16:32:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:20,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:20,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:20,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 16:32:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:20,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 16:32:20,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:32:20,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167369332] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:20,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:20,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-10-15 16:32:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916655849] [2022-10-15 16:32:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:32:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:32:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:32:20,499 INFO L87 Difference]: Start difference. First operand 980 states and 1276 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:20,680 INFO L93 Difference]: Finished difference Result 1222 states and 1607 transitions. [2022-10-15 16:32:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:32:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-10-15 16:32:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:20,688 INFO L225 Difference]: With dead ends: 1222 [2022-10-15 16:32:20,688 INFO L226 Difference]: Without dead ends: 1213 [2022-10-15 16:32:20,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:20,690 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 224 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:20,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 555 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-10-15 16:32:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 980. [2022-10-15 16:32:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 912 states have (on average 1.263157894736842) internal successors, (1152), 923 states have internal predecessors, (1152), 60 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2022-10-15 16:32:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1274 transitions. [2022-10-15 16:32:20,722 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1274 transitions. Word has length 62 [2022-10-15 16:32:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:20,722 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1274 transitions. [2022-10-15 16:32:20,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:32:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1274 transitions. [2022-10-15 16:32:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:20,725 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:20,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:20,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:20,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-15 16:32:20,939 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1351265008, now seen corresponding path program 1 times [2022-10-15 16:32:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286166253] [2022-10-15 16:32:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:21,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286166253] [2022-10-15 16:32:21,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286166253] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:21,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:21,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:32:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548502872] [2022-10-15 16:32:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:21,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:32:21,153 INFO L87 Difference]: Start difference. First operand 980 states and 1274 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:21,386 INFO L93 Difference]: Finished difference Result 1189 states and 1525 transitions. [2022-10-15 16:32:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:32:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-10-15 16:32:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:21,394 INFO L225 Difference]: With dead ends: 1189 [2022-10-15 16:32:21,394 INFO L226 Difference]: Without dead ends: 1189 [2022-10-15 16:32:21,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:21,395 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 229 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:21,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 961 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-10-15 16:32:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1055. [2022-10-15 16:32:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 987 states have (on average 1.2401215805471124) internal successors, (1224), 998 states have internal predecessors, (1224), 60 states have call successors, (60), 5 states have call predecessors, (60), 7 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2022-10-15 16:32:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1346 transitions. [2022-10-15 16:32:21,426 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1346 transitions. Word has length 62 [2022-10-15 16:32:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:21,427 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1346 transitions. [2022-10-15 16:32:21,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1346 transitions. [2022-10-15 16:32:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 16:32:21,430 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:21,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:21,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-10-15 16:32:21,430 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1349417966, now seen corresponding path program 1 times [2022-10-15 16:32:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725643207] [2022-10-15 16:32:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 16:32:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725643207] [2022-10-15 16:32:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725643207] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:21,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-15 16:32:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657346925] [2022-10-15 16:32:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:21,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:32:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:32:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:32:21,986 INFO L87 Difference]: Start difference. First operand 1055 states and 1346 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:22,657 INFO L93 Difference]: Finished difference Result 1116 states and 1419 transitions. [2022-10-15 16:32:22,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:22,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-10-15 16:32:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:22,664 INFO L225 Difference]: With dead ends: 1116 [2022-10-15 16:32:22,664 INFO L226 Difference]: Without dead ends: 1116 [2022-10-15 16:32:22,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:32:22,665 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 391 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:22,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1539 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:32:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-10-15 16:32:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1065. [2022-10-15 16:32:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 995 states have (on average 1.2381909547738694) internal successors, (1232), 1007 states have internal predecessors, (1232), 61 states have call successors, (61), 6 states have call predecessors, (61), 8 states have return successors, (63), 56 states have call predecessors, (63), 57 states have call successors, (63) [2022-10-15 16:32:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1356 transitions. [2022-10-15 16:32:22,694 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1356 transitions. Word has length 62 [2022-10-15 16:32:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:22,694 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1356 transitions. [2022-10-15 16:32:22,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1356 transitions. [2022-10-15 16:32:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:22,697 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:22,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:22,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-15 16:32:22,698 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:22,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1809166534, now seen corresponding path program 1 times [2022-10-15 16:32:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:22,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580435134] [2022-10-15 16:32:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:22,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580435134] [2022-10-15 16:32:22,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580435134] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:22,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873697551] [2022-10-15 16:32:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:22,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 16:32:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:22,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:32:22,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:23,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:23,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873697551] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:23,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:23,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-10-15 16:32:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442819789] [2022-10-15 16:32:23,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:23,113 INFO L87 Difference]: Start difference. First operand 1065 states and 1356 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:23,437 INFO L93 Difference]: Finished difference Result 2732 states and 3519 transitions. [2022-10-15 16:32:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:32:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:23,452 INFO L225 Difference]: With dead ends: 2732 [2022-10-15 16:32:23,452 INFO L226 Difference]: Without dead ends: 2732 [2022-10-15 16:32:23,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:23,453 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 340 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1645 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-10-15 16:32:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1170. [2022-10-15 16:32:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1098 states have (on average 1.2322404371584699) internal successors, (1353), 1108 states have internal predecessors, (1353), 62 states have call successors, (62), 6 states have call predecessors, (62), 9 states have return successors, (70), 60 states have call predecessors, (70), 58 states have call successors, (70) [2022-10-15 16:32:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1485 transitions. [2022-10-15 16:32:23,498 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1485 transitions. Word has length 65 [2022-10-15 16:32:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:23,499 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1485 transitions. [2022-10-15 16:32:23,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1485 transitions. [2022-10-15 16:32:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:23,502 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:23,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:23,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:23,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:23,718 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 796857020, now seen corresponding path program 1 times [2022-10-15 16:32:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:23,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65640798] [2022-10-15 16:32:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65640798] [2022-10-15 16:32:23,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65640798] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535490858] [2022-10-15 16:32:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:23,865 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:23,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 16:32:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:23,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:32:23,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:24,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535490858] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:24,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-10-15 16:32:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151198420] [2022-10-15 16:32:24,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:24,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 16:32:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 16:32:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:32:24,242 INFO L87 Difference]: Start difference. First operand 1170 states and 1485 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:25,137 INFO L93 Difference]: Finished difference Result 2880 states and 3727 transitions. [2022-10-15 16:32:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 16:32:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-10-15 16:32:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:25,152 INFO L225 Difference]: With dead ends: 2880 [2022-10-15 16:32:25,152 INFO L226 Difference]: Without dead ends: 2835 [2022-10-15 16:32:25,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 16:32:25,154 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 811 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:25,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1342 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:32:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-10-15 16:32:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1230. [2022-10-15 16:32:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1156 states have (on average 1.2283737024221453) internal successors, (1420), 1164 states have internal predecessors, (1420), 63 states have call successors, (63), 6 states have call predecessors, (63), 10 states have return successors, (79), 64 states have call predecessors, (79), 59 states have call successors, (79) [2022-10-15 16:32:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1562 transitions. [2022-10-15 16:32:25,197 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1562 transitions. Word has length 65 [2022-10-15 16:32:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:25,198 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1562 transitions. [2022-10-15 16:32:25,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1562 transitions. [2022-10-15 16:32:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:25,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:25,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:25,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:25,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-10-15 16:32:25,416 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1675153028, now seen corresponding path program 1 times [2022-10-15 16:32:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085660208] [2022-10-15 16:32:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085660208] [2022-10-15 16:32:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085660208] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252831530] [2022-10-15 16:32:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:25,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:25,609 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:25,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 16:32:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:25,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:32:25,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:25,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252831530] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:25,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:25,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-10-15 16:32:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671525907] [2022-10-15 16:32:25,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:32:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:32:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:32:25,864 INFO L87 Difference]: Start difference. First operand 1230 states and 1562 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:26,342 INFO L93 Difference]: Finished difference Result 3274 states and 4323 transitions. [2022-10-15 16:32:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 16:32:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:26,355 INFO L225 Difference]: With dead ends: 3274 [2022-10-15 16:32:26,355 INFO L226 Difference]: Without dead ends: 3274 [2022-10-15 16:32:26,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:32:26,356 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 289 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:26,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3355 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:32:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-10-15 16:32:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 1356. [2022-10-15 16:32:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1282 states have (on average 1.21996879875195) internal successors, (1564), 1290 states have internal predecessors, (1564), 63 states have call successors, (63), 6 states have call predecessors, (63), 10 states have return successors, (79), 64 states have call predecessors, (79), 59 states have call successors, (79) [2022-10-15 16:32:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1706 transitions. [2022-10-15 16:32:26,416 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1706 transitions. Word has length 65 [2022-10-15 16:32:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:26,416 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1706 transitions. [2022-10-15 16:32:26,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1706 transitions. [2022-10-15 16:32:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:26,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:26,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:26,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:26,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-10-15 16:32:26,633 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2070027080, now seen corresponding path program 1 times [2022-10-15 16:32:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:26,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821371707] [2022-10-15 16:32:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821371707] [2022-10-15 16:32:26,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821371707] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803345666] [2022-10-15 16:32:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:26,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:26,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 16:32:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:26,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 16:32:26,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:26,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:32:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 16:32:27,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803345666] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:32:27,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:32:27,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-10-15 16:32:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872239028] [2022-10-15 16:32:27,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:32:27,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 16:32:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 16:32:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:27,211 INFO L87 Difference]: Start difference. First operand 1356 states and 1706 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:28,284 INFO L93 Difference]: Finished difference Result 3861 states and 5045 transitions. [2022-10-15 16:32:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-15 16:32:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-10-15 16:32:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:28,313 INFO L225 Difference]: With dead ends: 3861 [2022-10-15 16:32:28,313 INFO L226 Difference]: Without dead ends: 3598 [2022-10-15 16:32:28,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-10-15 16:32:28,315 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 1095 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:28,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1720 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:32:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-10-15 16:32:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1272. [2022-10-15 16:32:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1199 states have (on average 1.224353628023353) internal successors, (1468), 1210 states have internal predecessors, (1468), 62 states have call successors, (62), 6 states have call predecessors, (62), 10 states have return successors, (73), 60 states have call predecessors, (73), 58 states have call successors, (73) [2022-10-15 16:32:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1603 transitions. [2022-10-15 16:32:28,392 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1603 transitions. Word has length 65 [2022-10-15 16:32:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:28,393 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1603 transitions. [2022-10-15 16:32:28,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:32:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1603 transitions. [2022-10-15 16:32:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:28,397 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:28,397 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:28,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:28,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-15 16:32:28,610 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1591451147, now seen corresponding path program 1 times [2022-10-15 16:32:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:28,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203287205] [2022-10-15 16:32:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:32:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:32:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:28,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203287205] [2022-10-15 16:32:28,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203287205] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:28,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633250913] [2022-10-15 16:32:28,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:28,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:28,733 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:28,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 16:32:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:28,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:32:28,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 16:32:28,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633250913] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:28,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-10-15 16:32:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107079273] [2022-10-15 16:32:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:28,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:28,849 INFO L87 Difference]: Start difference. First operand 1272 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:28,926 INFO L93 Difference]: Finished difference Result 1306 states and 1656 transitions. [2022-10-15 16:32:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:32:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-10-15 16:32:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:28,931 INFO L225 Difference]: With dead ends: 1306 [2022-10-15 16:32:28,932 INFO L226 Difference]: Without dead ends: 1306 [2022-10-15 16:32:28,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:32:28,933 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 36 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:28,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 265 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:32:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-10-15 16:32:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1281. [2022-10-15 16:32:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1208 states have (on average 1.2251655629139073) internal successors, (1480), 1219 states have internal predecessors, (1480), 62 states have call successors, (62), 6 states have call predecessors, (62), 10 states have return successors, (73), 60 states have call predecessors, (73), 58 states have call successors, (73) [2022-10-15 16:32:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1615 transitions. [2022-10-15 16:32:28,959 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1615 transitions. Word has length 65 [2022-10-15 16:32:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:28,959 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1615 transitions. [2022-10-15 16:32:28,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1615 transitions. [2022-10-15 16:32:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:28,964 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:28,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:29,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:29,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:29,178 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1307991932, now seen corresponding path program 2 times [2022-10-15 16:32:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477361440] [2022-10-15 16:32:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:29,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477361440] [2022-10-15 16:32:29,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477361440] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:29,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:29,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:32:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301348109] [2022-10-15 16:32:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:29,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:32:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:32:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:32:29,352 INFO L87 Difference]: Start difference. First operand 1281 states and 1615 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:29,697 INFO L93 Difference]: Finished difference Result 2247 states and 2910 transitions. [2022-10-15 16:32:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:32:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-10-15 16:32:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:29,704 INFO L225 Difference]: With dead ends: 2247 [2022-10-15 16:32:29,704 INFO L226 Difference]: Without dead ends: 2247 [2022-10-15 16:32:29,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:32:29,705 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 338 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:29,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1935 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-10-15 16:32:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1434. [2022-10-15 16:32:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1361 states have (on average 1.2174871418074944) internal successors, (1657), 1369 states have internal predecessors, (1657), 62 states have call successors, (62), 6 states have call predecessors, (62), 10 states have return successors, (73), 63 states have call predecessors, (73), 58 states have call successors, (73) [2022-10-15 16:32:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1792 transitions. [2022-10-15 16:32:29,741 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1792 transitions. Word has length 65 [2022-10-15 16:32:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:29,741 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1792 transitions. [2022-10-15 16:32:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1792 transitions. [2022-10-15 16:32:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 16:32:29,745 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:29,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:29,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-10-15 16:32:29,746 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash 913117880, now seen corresponding path program 1 times [2022-10-15 16:32:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:29,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133104998] [2022-10-15 16:32:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:32:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133104998] [2022-10-15 16:32:29,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133104998] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:29,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:32:29,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:32:29,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702973827] [2022-10-15 16:32:29,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:29,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:32:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:29,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:32:29,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:32:29,901 INFO L87 Difference]: Start difference. First operand 1434 states and 1792 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:30,227 INFO L93 Difference]: Finished difference Result 2423 states and 3092 transitions. [2022-10-15 16:32:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:32:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-10-15 16:32:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:30,233 INFO L225 Difference]: With dead ends: 2423 [2022-10-15 16:32:30,233 INFO L226 Difference]: Without dead ends: 2306 [2022-10-15 16:32:30,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:32:30,234 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 296 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:30,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1038 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:32:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-10-15 16:32:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1432. [2022-10-15 16:32:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1359 states have (on average 1.216335540838852) internal successors, (1653), 1365 states have internal predecessors, (1653), 62 states have call successors, (62), 6 states have call predecessors, (62), 10 states have return successors, (72), 65 states have call predecessors, (72), 58 states have call successors, (72) [2022-10-15 16:32:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1787 transitions. [2022-10-15 16:32:30,271 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1787 transitions. Word has length 65 [2022-10-15 16:32:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:30,271 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1787 transitions. [2022-10-15 16:32:30,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:32:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1787 transitions. [2022-10-15 16:32:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-15 16:32:30,275 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:30,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-10-15 16:32:30,275 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash -879168986, now seen corresponding path program 1 times [2022-10-15 16:32:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:30,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705961175] [2022-10-15 16:32:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:32:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 16:32:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:30,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 16:32:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:32:30,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:32:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705961175] [2022-10-15 16:32:30,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705961175] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:32:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523516491] [2022-10-15 16:32:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:32:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:32:30,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:32:30,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 16:32:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:32:30,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 16:32:30,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:32:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 16:32:30,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:32:30,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523516491] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:32:30,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:32:30,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-10-15 16:32:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738303920] [2022-10-15 16:32:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:32:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:32:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:32:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:32:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:32:30,427 INFO L87 Difference]: Start difference. First operand 1432 states and 1787 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:32:30,479 INFO L93 Difference]: Finished difference Result 1443 states and 1806 transitions. [2022-10-15 16:32:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:32:30,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-10-15 16:32:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:32:30,483 INFO L225 Difference]: With dead ends: 1443 [2022-10-15 16:32:30,484 INFO L226 Difference]: Without dead ends: 1443 [2022-10-15 16:32:30,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:32:30,485 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:32:30,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 407 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:32:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-10-15 16:32:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1433. [2022-10-15 16:32:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1360 states have (on average 1.2169117647058822) internal successors, (1655), 1366 states have internal predecessors, (1655), 62 states have call successors, (62), 6 states have call predecessors, (62), 10 states have return successors, (72), 65 states have call predecessors, (72), 58 states have call successors, (72) [2022-10-15 16:32:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1789 transitions. [2022-10-15 16:32:30,511 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1789 transitions. Word has length 66 [2022-10-15 16:32:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:32:30,511 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1789 transitions. [2022-10-15 16:32:30,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:32:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1789 transitions. [2022-10-15 16:32:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 16:32:30,515 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:32:30,515 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:30,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 16:32:30,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-15 16:32:30,732 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 16:32:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:32:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1561078251, now seen corresponding path program 1 times [2022-10-15 16:32:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:32:30,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72619072] [2022-10-15 16:32:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:32:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:32:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:32:30,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:32:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:32:30,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:32:30,849 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:32:30,851 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 16:32:30,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 16:32:30,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-10-15 16:32:30,861 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:32:30,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:32:30,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:32:30 BoogieIcfgContainer [2022-10-15 16:32:30,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:32:30,934 INFO L158 Benchmark]: Toolchain (without parser) took 30239.71ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 124.7MB in the beginning and 224.8MB in the end (delta: -100.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,934 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:32:30,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.36ms. Allocated memory is still 151.0MB. Free memory was 124.5MB in the beginning and 110.2MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.76ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,935 INFO L158 Benchmark]: Boogie Preprocessor took 48.77ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 105.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,935 INFO L158 Benchmark]: RCFGBuilder took 1220.03ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 115.1MB in the end (delta: -9.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,936 INFO L158 Benchmark]: TraceAbstraction took 28409.98ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 114.6MB in the beginning and 224.8MB in the end (delta: -110.2MB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. [2022-10-15 16:32:30,939 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.32ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 477.36ms. Allocated memory is still 151.0MB. Free memory was 124.5MB in the beginning and 110.2MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.76ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.77ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 105.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1220.03ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 115.1MB in the end (delta: -9.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * TraceAbstraction took 28409.98ms. Allocated memory was 151.0MB in the beginning and 262.1MB in the end (delta: 111.1MB). Free memory was 114.6MB in the beginning and 224.8MB in the end (delta: -110.2MB). Peak memory consumption was 1.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 - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseComplement at line 80, overapproximation of memtrack at line 21. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; VAL [ea=-125, eb=127] [L255] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L84] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L255] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L255] zero = base2flt(0, 0) [L256] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L33] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L61] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=144115188075855873] [L81] res = m | (unsigned int )((e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855875, res=4294967295, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L82] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855875, res=4294967295, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L84] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=144115188075855873, \result=144115188075855871, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855875, res=4294967295, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L256] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=144115188075855871, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, res = m | (unsigned int )((e + 128) << 24U)=50331648, zero=0] [L256] a = base2flt(ma, ea) [L257] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L33] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L61] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L63] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L68] COND TRUE e >= 127 [L69] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L84] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855875, \old(m)=33554432, \old(res = m | (unsigned int )((e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L257] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, zero=0] [L257] b = base2flt(mb, eb) [L259] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, zero=0] [L262] COND TRUE a > zero [L263] tmp = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, tmp=1, zero=0] [L267] sa = tmp VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L269] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L272] COND TRUE b > zero [L273] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, sa=1, tmp=1, tmp___0=1, zero=0] [L277] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=16777216, mb=33554432, res = m | (unsigned int )((e + 128) << 24U)=50331648, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L280] CALL addflt(a, b) [L88] unsigned int res ; [L89] unsigned int ma ; [L90] unsigned int mb ; [L91] unsigned int delta ; [L92] int ea ; [L93] int eb ; [L94] unsigned int tmp ; [L95] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L98] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L105] COND FALSE !(! b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855875, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L112] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855875, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L113] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855875, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L114] ma = ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855875, ma=2, ma = a & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L115] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855875, ma=2, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L116] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=2, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L117] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855875, ma=2, ma = a & ((1U << 24U) - 1U)=16777215, mb=0, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L118] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=144115188075855875, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855875, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] [L21] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855875, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | (unsigned int )((e + 128) << 24U)=50331648] - UnprovableResult [Line: 229]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8254 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8087 mSDsluCounter, 42128 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35103 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8760 IncrementalHoareTripleChecker+Invalid, 9586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 7025 mSDtfsCounter, 8760 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 1595 SyntacticMatches, 40 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=35, InterpolantAutomatonStates: 361, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 12745 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 2913 NumberOfCodeBlocks, 2913 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3355 ConstructedInterpolants, 0 QuantifiedInterpolants, 9263 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2679 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 916/1054 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:32:30,967 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...