/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/systemc/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:51:24,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:51:24,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:51:24,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:51:24,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:51:24,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:51:24,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:51:24,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:51:24,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:51:24,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:51:24,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:51:24,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:51:24,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:51:24,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:51:24,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:51:24,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:51:24,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:51:24,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:51:24,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:51:24,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:51:24,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:51:24,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:51:24,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:51:24,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:51:24,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:51:24,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:51:24,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:51:24,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:51:24,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:51:24,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:51:24,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:51:24,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:51:24,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:51:24,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:51:24,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:51:24,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:51:24,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:51:24,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:51:24,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:51:24,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:51:24,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:51:24,854 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 17:51:24,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:51:24,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:51:24,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:51:24,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:51:24,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:51:24,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:51:24,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:51:24,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:51:24,895 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:51:24,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:51:24,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:51:24,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:51:24,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:51:24,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:51:24,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:51:24,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:51:24,900 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:51:24,900 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:51:24,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:51:24,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:51:24,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:51:24,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:51:24,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:51:24,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:51:24,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:51:24,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:51:24,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:51:24,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:51:24,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:51:24,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:51:24,905 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 17:51:25,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:51:25,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:51:25,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:51:25,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:51:25,448 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:51:25,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-10-15 17:51:25,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef441e130/606814bc2a274003b1c76810199e4160/FLAG167bfe9c3 [2022-10-15 17:51:26,212 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:51:26,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-10-15 17:51:26,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef441e130/606814bc2a274003b1c76810199e4160/FLAG167bfe9c3 [2022-10-15 17:51:26,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef441e130/606814bc2a274003b1c76810199e4160 [2022-10-15 17:51:26,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:51:26,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:51:26,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:51:26,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:51:26,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:51:26,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:51:26" (1/1) ... [2022-10-15 17:51:26,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b16efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:26, skipping insertion in model container [2022-10-15 17:51:26,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:51:26" (1/1) ... [2022-10-15 17:51:26,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:51:26,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:51:26,895 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/systemc/transmitter.01.cil.c[706,719] [2022-10-15 17:51:26,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:51:26,961 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:51:26,977 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/systemc/transmitter.01.cil.c[706,719] [2022-10-15 17:51:27,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:51:27,026 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:51:27,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27 WrapperNode [2022-10-15 17:51:27,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:51:27,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:51:27,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:51:27,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:51:27,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,082 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2022-10-15 17:51:27,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:51:27,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:51:27,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:51:27,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:51:27,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:51:27,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:51:27,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:51:27,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:51:27,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (1/1) ... [2022-10-15 17:51:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:51:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:27,221 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 17:51:27,230 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 17:51:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:51:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-15 17:51:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-15 17:51:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-15 17:51:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-15 17:51:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-15 17:51:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-15 17:51:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-15 17:51:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-15 17:51:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:51:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-15 17:51:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-15 17:51:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:51:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:51:27,374 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:51:27,377 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:51:27,839 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:51:27,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:51:27,852 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-15 17:51:27,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:51:27 BoogieIcfgContainer [2022-10-15 17:51:27,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:51:27,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:51:27,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:51:27,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:51:27,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:51:26" (1/3) ... [2022-10-15 17:51:27,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1dde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:51:27, skipping insertion in model container [2022-10-15 17:51:27,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:27" (2/3) ... [2022-10-15 17:51:27,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1dde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:51:27, skipping insertion in model container [2022-10-15 17:51:27,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:51:27" (3/3) ... [2022-10-15 17:51:27,871 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2022-10-15 17:51:27,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:51:27,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:51:27,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:51:27,996 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;@1ae75941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:51:27,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:51:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.5375) internal successors, (123), 83 states have internal predecessors, (123), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 17:51:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 17:51:28,016 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:28,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:28,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1852641376, now seen corresponding path program 1 times [2022-10-15 17:51:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:28,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510701843] [2022-10-15 17:51:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:28,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510701843] [2022-10-15 17:51:28,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510701843] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:28,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:28,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:28,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844120699] [2022-10-15 17:51:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:28,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:28,671 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.5375) internal successors, (123), 83 states have internal predecessors, (123), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:51:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:29,099 INFO L93 Difference]: Finished difference Result 120 states and 169 transitions. [2022-10-15 17:51:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:51:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-10-15 17:51:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:29,114 INFO L225 Difference]: With dead ends: 120 [2022-10-15 17:51:29,115 INFO L226 Difference]: Without dead ends: 118 [2022-10-15 17:51:29,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:51:29,122 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 198 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:29,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 362 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:51:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-15 17:51:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2022-10-15 17:51:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 80 states have internal predecessors, (108), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-10-15 17:51:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2022-10-15 17:51:29,185 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 40 [2022-10-15 17:51:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:29,186 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2022-10-15 17:51:29,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:51:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2022-10-15 17:51:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:29,189 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:29,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:51:29,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1066417040, now seen corresponding path program 1 times [2022-10-15 17:51:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844994206] [2022-10-15 17:51:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:29,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:29,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844994206] [2022-10-15 17:51:29,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844994206] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:29,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:29,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24959659] [2022-10-15 17:51:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:29,499 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:30,192 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2022-10-15 17:51:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:51:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:30,197 INFO L225 Difference]: With dead ends: 254 [2022-10-15 17:51:30,197 INFO L226 Difference]: Without dead ends: 254 [2022-10-15 17:51:30,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:51:30,200 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 339 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:30,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 668 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:51:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-10-15 17:51:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 178. [2022-10-15 17:51:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 146 states have internal predecessors, (199), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-10-15 17:51:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2022-10-15 17:51:30,239 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 55 [2022-10-15 17:51:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:30,239 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2022-10-15 17:51:30,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2022-10-15 17:51:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:30,248 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:30,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:30,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:51:30,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1314563534, now seen corresponding path program 1 times [2022-10-15 17:51:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:30,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794081150] [2022-10-15 17:51:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794081150] [2022-10-15 17:51:30,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794081150] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:30,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:30,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:51:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954856399] [2022-10-15 17:51:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:51:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:51:30,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:30,436 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:30,888 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2022-10-15 17:51:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:51:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:30,893 INFO L225 Difference]: With dead ends: 299 [2022-10-15 17:51:30,893 INFO L226 Difference]: Without dead ends: 299 [2022-10-15 17:51:30,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:51:30,896 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 350 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:30,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 541 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:51:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-10-15 17:51:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2022-10-15 17:51:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 197 states have (on average 1.385786802030457) internal successors, (273), 202 states have internal predecessors, (273), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-10-15 17:51:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 342 transitions. [2022-10-15 17:51:30,924 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 342 transitions. Word has length 55 [2022-10-15 17:51:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:30,924 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 342 transitions. [2022-10-15 17:51:30,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 342 transitions. [2022-10-15 17:51:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:30,927 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:30,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:30,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:51:30,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1855143793, now seen corresponding path program 1 times [2022-10-15 17:51:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:30,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738838424] [2022-10-15 17:51:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:31,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738838424] [2022-10-15 17:51:31,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738838424] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:31,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:31,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440647285] [2022-10-15 17:51:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:31,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:31,188 INFO L87 Difference]: Start difference. First operand 247 states and 342 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:31,569 INFO L93 Difference]: Finished difference Result 289 states and 405 transitions. [2022-10-15 17:51:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:51:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:31,574 INFO L225 Difference]: With dead ends: 289 [2022-10-15 17:51:31,574 INFO L226 Difference]: Without dead ends: 289 [2022-10-15 17:51:31,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:51:31,587 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 155 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:31,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 473 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-10-15 17:51:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2022-10-15 17:51:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 200 states have (on average 1.37) internal successors, (274), 205 states have internal predecessors, (274), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-10-15 17:51:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2022-10-15 17:51:31,630 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 55 [2022-10-15 17:51:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:31,631 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2022-10-15 17:51:31,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2022-10-15 17:51:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:31,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:31,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:31,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:51:31,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1927530351, now seen corresponding path program 1 times [2022-10-15 17:51:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:31,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095886909] [2022-10-15 17:51:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095886909] [2022-10-15 17:51:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095886909] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:31,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:31,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613014156] [2022-10-15 17:51:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:31,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:31,771 INFO L87 Difference]: Start difference. First operand 250 states and 343 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:32,192 INFO L93 Difference]: Finished difference Result 298 states and 415 transitions. [2022-10-15 17:51:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:51:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:32,197 INFO L225 Difference]: With dead ends: 298 [2022-10-15 17:51:32,197 INFO L226 Difference]: Without dead ends: 298 [2022-10-15 17:51:32,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:51:32,199 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 119 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:32,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 467 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-10-15 17:51:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 259. [2022-10-15 17:51:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 209 states have (on average 1.354066985645933) internal successors, (283), 214 states have internal predecessors, (283), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-10-15 17:51:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 352 transitions. [2022-10-15 17:51:32,217 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 352 transitions. Word has length 55 [2022-10-15 17:51:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:32,218 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 352 transitions. [2022-10-15 17:51:32,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 352 transitions. [2022-10-15 17:51:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:32,221 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:32,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:51:32,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash -4302317, now seen corresponding path program 1 times [2022-10-15 17:51:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:32,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302134796] [2022-10-15 17:51:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:32,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302134796] [2022-10-15 17:51:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302134796] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:32,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993094321] [2022-10-15 17:51:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:32,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:32,398 INFO L87 Difference]: Start difference. First operand 259 states and 352 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:32,805 INFO L93 Difference]: Finished difference Result 482 states and 640 transitions. [2022-10-15 17:51:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:51:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:32,810 INFO L225 Difference]: With dead ends: 482 [2022-10-15 17:51:32,810 INFO L226 Difference]: Without dead ends: 482 [2022-10-15 17:51:32,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-10-15 17:51:32,812 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 369 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:32,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 429 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:51:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-10-15 17:51:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 414. [2022-10-15 17:51:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 339 states have (on average 1.3421828908554572) internal successors, (455), 346 states have internal predecessors, (455), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-10-15 17:51:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 550 transitions. [2022-10-15 17:51:32,837 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 550 transitions. Word has length 55 [2022-10-15 17:51:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:32,837 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 550 transitions. [2022-10-15 17:51:32,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 550 transitions. [2022-10-15 17:51:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:32,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:32,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:32,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:51:32,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1809740651, now seen corresponding path program 1 times [2022-10-15 17:51:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:32,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954548] [2022-10-15 17:51:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:32,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954548] [2022-10-15 17:51:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954548] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:32,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:32,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981096409] [2022-10-15 17:51:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:32,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:32,980 INFO L87 Difference]: Start difference. First operand 414 states and 550 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:33,172 INFO L93 Difference]: Finished difference Result 451 states and 587 transitions. [2022-10-15 17:51:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:51:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:33,177 INFO L225 Difference]: With dead ends: 451 [2022-10-15 17:51:33,177 INFO L226 Difference]: Without dead ends: 451 [2022-10-15 17:51:33,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:51:33,178 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 266 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:33,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 278 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:51:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-10-15 17:51:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 413. [2022-10-15 17:51:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 338 states have (on average 1.3076923076923077) internal successors, (442), 345 states have internal predecessors, (442), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-10-15 17:51:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 537 transitions. [2022-10-15 17:51:33,197 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 537 transitions. Word has length 55 [2022-10-15 17:51:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:33,198 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 537 transitions. [2022-10-15 17:51:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 537 transitions. [2022-10-15 17:51:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:51:33,199 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:33,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:51:33,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1590885933, now seen corresponding path program 1 times [2022-10-15 17:51:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:33,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078008357] [2022-10-15 17:51:33,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:33,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078008357] [2022-10-15 17:51:33,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078008357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:33,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:33,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:51:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578810075] [2022-10-15 17:51:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:33,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:51:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:51:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:33,300 INFO L87 Difference]: Start difference. First operand 413 states and 537 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:33,590 INFO L93 Difference]: Finished difference Result 855 states and 1109 transitions. [2022-10-15 17:51:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:51:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-10-15 17:51:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:33,598 INFO L225 Difference]: With dead ends: 855 [2022-10-15 17:51:33,598 INFO L226 Difference]: Without dead ends: 855 [2022-10-15 17:51:33,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:51:33,599 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 327 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:33,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 303 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-10-15 17:51:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 790. [2022-10-15 17:51:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 646 states have (on average 1.2910216718266254) internal successors, (834), 658 states have internal predecessors, (834), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2022-10-15 17:51:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1032 transitions. [2022-10-15 17:51:33,631 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1032 transitions. Word has length 55 [2022-10-15 17:51:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:33,632 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1032 transitions. [2022-10-15 17:51:33,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1032 transitions. [2022-10-15 17:51:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 17:51:33,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:33,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:33,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:51:33,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash -217847715, now seen corresponding path program 1 times [2022-10-15 17:51:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:33,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610037196] [2022-10-15 17:51:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:33,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610037196] [2022-10-15 17:51:33,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610037196] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:33,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:33,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:51:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968112913] [2022-10-15 17:51:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:33,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:51:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:33,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:51:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:51:33,708 INFO L87 Difference]: Start difference. First operand 790 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:51:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:33,961 INFO L93 Difference]: Finished difference Result 1607 states and 2047 transitions. [2022-10-15 17:51:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:51:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2022-10-15 17:51:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:33,971 INFO L225 Difference]: With dead ends: 1607 [2022-10-15 17:51:33,971 INFO L226 Difference]: Without dead ends: 1607 [2022-10-15 17:51:33,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:51:33,973 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 267 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:33,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 288 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2022-10-15 17:51:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1474. [2022-10-15 17:51:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1195 states have (on average 1.2677824267782427) internal successors, (1515), 1216 states have internal predecessors, (1515), 163 states have call successors, (163), 100 states have call predecessors, (163), 114 states have return successors, (217), 161 states have call predecessors, (217), 163 states have call successors, (217) [2022-10-15 17:51:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1895 transitions. [2022-10-15 17:51:34,032 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1895 transitions. Word has length 56 [2022-10-15 17:51:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:34,033 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 1895 transitions. [2022-10-15 17:51:34,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:51:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1895 transitions. [2022-10-15 17:51:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-15 17:51:34,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:34,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:51:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:51:34,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -283918956, now seen corresponding path program 1 times [2022-10-15 17:51:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107030041] [2022-10-15 17:51:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:51:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:51:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 17:51:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-15 17:51:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:51:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107030041] [2022-10-15 17:51:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107030041] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:34,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:51:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282461712] [2022-10-15 17:51:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:51:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:51:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:34,138 INFO L87 Difference]: Start difference. First operand 1474 states and 1895 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:51:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:34,772 INFO L93 Difference]: Finished difference Result 3068 states and 3918 transitions. [2022-10-15 17:51:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:51:34,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-10-15 17:51:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:34,790 INFO L225 Difference]: With dead ends: 3068 [2022-10-15 17:51:34,791 INFO L226 Difference]: Without dead ends: 3068 [2022-10-15 17:51:34,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:51:34,792 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 506 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:34,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 577 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:51:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2022-10-15 17:51:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2884. [2022-10-15 17:51:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2319 states have (on average 1.2457956015523932) internal successors, (2889), 2370 states have internal predecessors, (2889), 325 states have call successors, (325), 200 states have call predecessors, (325), 238 states have return successors, (502), 321 states have call predecessors, (502), 325 states have call successors, (502) [2022-10-15 17:51:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 3716 transitions. [2022-10-15 17:51:34,893 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 3716 transitions. Word has length 73 [2022-10-15 17:51:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:34,893 INFO L495 AbstractCegarLoop]: Abstraction has 2884 states and 3716 transitions. [2022-10-15 17:51:34,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:51:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3716 transitions. [2022-10-15 17:51:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-15 17:51:34,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:34,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:51:34,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:51:34,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash -827437153, now seen corresponding path program 1 times [2022-10-15 17:51:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:34,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064400771] [2022-10-15 17:51:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:34,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:51:34,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:51:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:51:34,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:51:34,967 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:51:34,969 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:51:34,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:51:34,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:51:34,975 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:34,980 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:51:35,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:51:35 BoogieIcfgContainer [2022-10-15 17:51:35,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:51:35,063 INFO L158 Benchmark]: Toolchain (without parser) took 8476.04ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 133.4MB in the beginning and 91.5MB in the end (delta: 41.8MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,063 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 159.4MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:51:35,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.83ms. Allocated memory is still 159.4MB. Free memory was 133.1MB in the beginning and 121.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 159.4MB. Free memory was 121.0MB in the beginning and 119.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 80.26ms. Allocated memory is still 159.4MB. Free memory was 119.0MB in the beginning and 117.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,064 INFO L158 Benchmark]: RCFGBuilder took 693.12ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 133.8MB in the end (delta: -16.4MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,065 INFO L158 Benchmark]: TraceAbstraction took 7199.74ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 133.3MB in the beginning and 91.5MB in the end (delta: 41.8MB). Peak memory consumption was 73.7MB. Max. memory is 8.0GB. [2022-10-15 17:51:35,067 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.30ms. Allocated memory is still 159.4MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.83ms. Allocated memory is still 159.4MB. Free memory was 133.1MB in the beginning and 121.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 159.4MB. Free memory was 121.0MB in the beginning and 119.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.26ms. Allocated memory is still 159.4MB. Free memory was 119.0MB in the beginning and 117.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 693.12ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 133.8MB in the end (delta: -16.4MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7199.74ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 133.3MB in the beginning and 91.5MB in the end (delta: 41.8MB). Peak memory consumption was 73.7MB. 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 memtrack at line 21. Possible FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - UnprovableResult [Line: 448]: 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 6 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2985 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2896 mSDsluCounter, 4386 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2876 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3092 IncrementalHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 1510 mSDtfsCounter, 3092 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2884occurred in iteration=10, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 714 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 1154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 14/14 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 17:51:35,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...