/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/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:49:00,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:49:00,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:49:00,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:49:00,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:49:00,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:49:00,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:49:00,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:49:00,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:49:00,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:49:00,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:49:00,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:49:00,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:49:00,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:49:00,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:49:00,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:49:00,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:49:00,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:49:00,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:49:00,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:49:00,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:49:00,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:49:00,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:49:00,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:49:00,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:49:00,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:49:00,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:49:00,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:49:00,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:49:00,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:49:00,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:49:00,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:49:00,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:49:00,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:49:00,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:49:00,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:49:00,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:49:00,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:49:00,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:49:00,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:49:00,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:49:00,370 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:49:00,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:49:00,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:49:00,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:49:00,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:49:00,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:49:00,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:49:00,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:49:00,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:49:00,445 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:49:00,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:49:00,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:49:00,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:49:00,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:49:00,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:49:00,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:49:00,448 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:49:00,448 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:49:00,448 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:49:00,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:49:00,449 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:49:00,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:49:00,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:49:00,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:49:00,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:49:00,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:49:00,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:00,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:49:00,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:49:00,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:49:00,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:49:00,451 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:49:00,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:49:00,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:49:00,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:49:00,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:49:00,908 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:49:00,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2022-10-15 17:49:01,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4f2b235/2d1b3c3b7afb4483b720ee700dbf8d83/FLAG2725ce4e5 [2022-10-15 17:49:01,626 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:49:01,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2022-10-15 17:49:01,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4f2b235/2d1b3c3b7afb4483b720ee700dbf8d83/FLAG2725ce4e5 [2022-10-15 17:49:01,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4f2b235/2d1b3c3b7afb4483b720ee700dbf8d83 [2022-10-15 17:49:01,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:49:01,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:49:01,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:01,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:49:01,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:49:01,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:01" (1/1) ... [2022-10-15 17:49:02,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d28f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02, skipping insertion in model container [2022-10-15 17:49:02,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:01" (1/1) ... [2022-10-15 17:49:02,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:49:02,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:49:02,314 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/kundu1.cil.c[636,649] [2022-10-15 17:49:02,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:02,431 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:49:02,445 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/kundu1.cil.c[636,649] [2022-10-15 17:49:02,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:02,490 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:49:02,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02 WrapperNode [2022-10-15 17:49:02,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:02,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:02,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:49:02,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:49:02,501 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:49:02" (1/1) ... [2022-10-15 17:49:02,511 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:49:02" (1/1) ... [2022-10-15 17:49:02,548 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 257 [2022-10-15 17:49:02,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:02,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:49:02,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:49:02,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:49:02,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:49:02,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:49:02,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:49:02,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:49:02,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (1/1) ... [2022-10-15 17:49:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:02,638 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:49:02,645 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:49:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:49:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-15 17:49:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-15 17:49:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-15 17:49:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-15 17:49:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-15 17:49:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-15 17:49:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-15 17:49:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-15 17:49:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-15 17:49:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-15 17:49:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:49:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-15 17:49:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-15 17:49:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:49:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:49:02,805 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:49:02,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:49:03,292 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:49:03,314 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:49:03,315 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-15 17:49:03,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:03 BoogieIcfgContainer [2022-10-15 17:49:03,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:49:03,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:49:03,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:49:03,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:49:03,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:49:01" (1/3) ... [2022-10-15 17:49:03,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174610d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:03, skipping insertion in model container [2022-10-15 17:49:03,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:02" (2/3) ... [2022-10-15 17:49:03,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174610d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:03, skipping insertion in model container [2022-10-15 17:49:03,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:03" (3/3) ... [2022-10-15 17:49:03,338 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-10-15 17:49:03,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:49:03,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:49:03,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:49:03,469 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;@538e35e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:49:03,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:49:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 90 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-10-15 17:49:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 17:49:03,493 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:03,494 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] [2022-10-15 17:49:03,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 27313174, now seen corresponding path program 1 times [2022-10-15 17:49:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:03,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911930326] [2022-10-15 17:49:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-10-15 17:49:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:03,946 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:49:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:03,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911930326] [2022-10-15 17:49:03,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911930326] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:03,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:03,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439422083] [2022-10-15 17:49:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:03,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:03,991 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 90 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 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:49:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:04,332 INFO L93 Difference]: Finished difference Result 221 states and 303 transitions. [2022-10-15 17:49:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:49:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 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 34 [2022-10-15 17:49:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:04,351 INFO L225 Difference]: With dead ends: 221 [2022-10-15 17:49:04,351 INFO L226 Difference]: Without dead ends: 217 [2022-10-15 17:49:04,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:04,359 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 297 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:04,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 662 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-10-15 17:49:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 183. [2022-10-15 17:49:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.412162162162162) internal successors, (209), 152 states have internal predecessors, (209), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-10-15 17:49:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 252 transitions. [2022-10-15 17:49:04,472 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 252 transitions. Word has length 34 [2022-10-15 17:49:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:04,474 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 252 transitions. [2022-10-15 17:49:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 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:49:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 252 transitions. [2022-10-15 17:49:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 17:49:04,481 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:04,482 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] [2022-10-15 17:49:04,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:49:04,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2114651007, now seen corresponding path program 1 times [2022-10-15 17:49:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359475646] [2022-10-15 17:49:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-10-15 17:49:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 17:49:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:04,919 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:49:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:04,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359475646] [2022-10-15 17:49:04,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359475646] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:04,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:04,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932831729] [2022-10-15 17:49:04,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:04,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:04,927 INFO L87 Difference]: Start difference. First operand 183 states and 252 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:05,228 INFO L93 Difference]: Finished difference Result 214 states and 298 transitions. [2022-10-15 17:49:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:49:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-10-15 17:49:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:05,232 INFO L225 Difference]: With dead ends: 214 [2022-10-15 17:49:05,232 INFO L226 Difference]: Without dead ends: 214 [2022-10-15 17:49:05,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:49:05,241 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 117 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:05,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 652 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-10-15 17:49:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2022-10-15 17:49:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.3973509933774835) internal successors, (211), 155 states have internal predecessors, (211), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-10-15 17:49:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 254 transitions. [2022-10-15 17:49:05,306 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 254 transitions. Word has length 51 [2022-10-15 17:49:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:05,307 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 254 transitions. [2022-10-15 17:49:05,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 254 transitions. [2022-10-15 17:49:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 17:49:05,311 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:05,311 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] [2022-10-15 17:49:05,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:49:05,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1905556675, now seen corresponding path program 1 times [2022-10-15 17:49:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:05,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158536264] [2022-10-15 17:49:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-10-15 17:49:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 17:49:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:05,519 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:49:05,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158536264] [2022-10-15 17:49:05,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158536264] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:05,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:05,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874903986] [2022-10-15 17:49:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:05,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:05,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:05,527 INFO L87 Difference]: Start difference. First operand 186 states and 254 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:06,095 INFO L93 Difference]: Finished difference Result 558 states and 765 transitions. [2022-10-15 17:49:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:49:06,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-10-15 17:49:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:06,102 INFO L225 Difference]: With dead ends: 558 [2022-10-15 17:49:06,102 INFO L226 Difference]: Without dead ends: 558 [2022-10-15 17:49:06,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:49:06,105 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 488 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:06,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 764 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:49:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-10-15 17:49:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 336. [2022-10-15 17:49:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 275 states have (on average 1.3818181818181818) internal successors, (380), 279 states have internal predecessors, (380), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-10-15 17:49:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2022-10-15 17:49:06,172 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 51 [2022-10-15 17:49:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:06,172 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2022-10-15 17:49:06,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2022-10-15 17:49:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 17:49:06,175 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:06,175 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] [2022-10-15 17:49:06,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:49:06,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1961555762, now seen corresponding path program 1 times [2022-10-15 17:49:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:06,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883962320] [2022-10-15 17:49:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,320 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:49:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883962320] [2022-10-15 17:49:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883962320] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:06,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:06,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648027838] [2022-10-15 17:49:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:06,326 INFO L87 Difference]: Start difference. First operand 336 states and 457 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:06,600 INFO L93 Difference]: Finished difference Result 868 states and 1176 transitions. [2022-10-15 17:49:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:49:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-10-15 17:49:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:06,615 INFO L225 Difference]: With dead ends: 868 [2022-10-15 17:49:06,615 INFO L226 Difference]: Without dead ends: 868 [2022-10-15 17:49:06,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:06,627 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 300 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:06,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 762 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-10-15 17:49:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 761. [2022-10-15 17:49:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 622 states have (on average 1.3360128617363345) internal successors, (831), 626 states have internal predecessors, (831), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-10-15 17:49:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1016 transitions. [2022-10-15 17:49:06,720 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1016 transitions. Word has length 52 [2022-10-15 17:49:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:06,721 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 1016 transitions. [2022-10-15 17:49:06,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1016 transitions. [2022-10-15 17:49:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 17:49:06,724 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:06,724 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] [2022-10-15 17:49:06,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:49:06,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1904411537, now seen corresponding path program 1 times [2022-10-15 17:49:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430918366] [2022-10-15 17:49:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:06,862 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:49:06,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430918366] [2022-10-15 17:49:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430918366] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:06,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:06,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117324365] [2022-10-15 17:49:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:06,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:06,866 INFO L87 Difference]: Start difference. First operand 761 states and 1016 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:07,062 INFO L93 Difference]: Finished difference Result 842 states and 1145 transitions. [2022-10-15 17:49:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:49:07,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-10-15 17:49:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:07,072 INFO L225 Difference]: With dead ends: 842 [2022-10-15 17:49:07,072 INFO L226 Difference]: Without dead ends: 842 [2022-10-15 17:49:07,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:49:07,079 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 58 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:07,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 593 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-10-15 17:49:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 779. [2022-10-15 17:49:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 640 states have (on average 1.3203125) internal successors, (845), 644 states have internal predecessors, (845), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-10-15 17:49:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1030 transitions. [2022-10-15 17:49:07,155 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1030 transitions. Word has length 52 [2022-10-15 17:49:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:07,155 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1030 transitions. [2022-10-15 17:49:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1030 transitions. [2022-10-15 17:49:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 17:49:07,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:07,166 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] [2022-10-15 17:49:07,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:49:07,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1966451151, now seen corresponding path program 1 times [2022-10-15 17:49:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:07,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681007919] [2022-10-15 17:49:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,343 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:49:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:07,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681007919] [2022-10-15 17:49:07,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681007919] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357500150] [2022-10-15 17:49:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:07,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:07,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:07,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:07,351 INFO L87 Difference]: Start difference. First operand 779 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:07,608 INFO L93 Difference]: Finished difference Result 1943 states and 2743 transitions. [2022-10-15 17:49:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:49:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-10-15 17:49:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:07,623 INFO L225 Difference]: With dead ends: 1943 [2022-10-15 17:49:07,623 INFO L226 Difference]: Without dead ends: 1943 [2022-10-15 17:49:07,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:07,625 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 281 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:07,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 664 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2022-10-15 17:49:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1305. [2022-10-15 17:49:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1075 states have (on average 1.3172093023255813) internal successors, (1416), 1079 states have internal predecessors, (1416), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2022-10-15 17:49:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1725 transitions. [2022-10-15 17:49:07,703 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1725 transitions. Word has length 52 [2022-10-15 17:49:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:07,704 INFO L495 AbstractCegarLoop]: Abstraction has 1305 states and 1725 transitions. [2022-10-15 17:49:07,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1725 transitions. [2022-10-15 17:49:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 17:49:07,705 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:07,706 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, 1, 1, 1, 1] [2022-10-15 17:49:07,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:49:07,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -366882167, now seen corresponding path program 1 times [2022-10-15 17:49:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326480245] [2022-10-15 17:49:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:07,919 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:49:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:07,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326480245] [2022-10-15 17:49:07,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326480245] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:07,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:07,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523674581] [2022-10-15 17:49:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:07,927 INFO L87 Difference]: Start difference. First operand 1305 states and 1725 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:08,168 INFO L93 Difference]: Finished difference Result 1582 states and 2104 transitions. [2022-10-15 17:49:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:49:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-10-15 17:49:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:08,177 INFO L225 Difference]: With dead ends: 1582 [2022-10-15 17:49:08,178 INFO L226 Difference]: Without dead ends: 1582 [2022-10-15 17:49:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:08,180 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 436 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:08,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 625 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-10-15 17:49:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1465. [2022-10-15 17:49:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1209 states have (on average 1.315136476426799) internal successors, (1590), 1213 states have internal predecessors, (1590), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2022-10-15 17:49:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1933 transitions. [2022-10-15 17:49:08,233 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1933 transitions. Word has length 60 [2022-10-15 17:49:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:08,236 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 1933 transitions. [2022-10-15 17:49:08,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1933 transitions. [2022-10-15 17:49:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-15 17:49:08,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:08,237 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:08,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:49:08,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash 888897310, now seen corresponding path program 1 times [2022-10-15 17:49:08,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:08,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704725032] [2022-10-15 17:49:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704725032] [2022-10-15 17:49:08,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704725032] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:08,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:08,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501691548] [2022-10-15 17:49:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:08,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:08,404 INFO L87 Difference]: Start difference. First operand 1465 states and 1933 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:08,777 INFO L93 Difference]: Finished difference Result 3308 states and 4683 transitions. [2022-10-15 17:49:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:49:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-10-15 17:49:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:08,815 INFO L225 Difference]: With dead ends: 3308 [2022-10-15 17:49:08,816 INFO L226 Difference]: Without dead ends: 3308 [2022-10-15 17:49:08,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:49:08,817 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 601 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:08,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 969 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-10-15 17:49:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 2077. [2022-10-15 17:49:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 1717 states have (on average 1.3133372160745487) internal successors, (2255), 1721 states have internal predecessors, (2255), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2022-10-15 17:49:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2740 transitions. [2022-10-15 17:49:08,913 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2740 transitions. Word has length 63 [2022-10-15 17:49:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:08,913 INFO L495 AbstractCegarLoop]: Abstraction has 2077 states and 2740 transitions. [2022-10-15 17:49:08,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-15 17:49:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2740 transitions. [2022-10-15 17:49:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 17:49:08,915 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:08,915 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:49:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:49:08,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash -494174309, now seen corresponding path program 1 times [2022-10-15 17:49:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183659623] [2022-10-15 17:49:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:49:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183659623] [2022-10-15 17:49:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183659623] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393216757] [2022-10-15 17:49:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:09,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:09,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:09,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:49:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:09,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:49:09,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:09,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393216757] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:09,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:09,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 17:49:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565660807] [2022-10-15 17:49:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:09,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:09,162 INFO L87 Difference]: Start difference. First operand 2077 states and 2740 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 17:49:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:09,255 INFO L93 Difference]: Finished difference Result 3729 states and 4922 transitions. [2022-10-15 17:49:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-10-15 17:49:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:09,281 INFO L225 Difference]: With dead ends: 3729 [2022-10-15 17:49:09,282 INFO L226 Difference]: Without dead ends: 3729 [2022-10-15 17:49:09,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:09,283 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 95 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:09,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2022-10-15 17:49:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3588. [2022-10-15 17:49:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 2939 states have (on average 1.2915957808778495) internal successors, (3796), 2944 states have internal predecessors, (3796), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-10-15 17:49:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4751 transitions. [2022-10-15 17:49:09,439 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4751 transitions. Word has length 68 [2022-10-15 17:49:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:09,439 INFO L495 AbstractCegarLoop]: Abstraction has 3588 states and 4751 transitions. [2022-10-15 17:49:09,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 17:49:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4751 transitions. [2022-10-15 17:49:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-15 17:49:09,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:09,442 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] [2022-10-15 17:49:09,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:09,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:09,657 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1472868894, now seen corresponding path program 1 times [2022-10-15 17:49:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498130460] [2022-10-15 17:49:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 17:49:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:49:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:09,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498130460] [2022-10-15 17:49:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498130460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:09,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:09,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399529110] [2022-10-15 17:49:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:09,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:09,789 INFO L87 Difference]: Start difference. First operand 3588 states and 4751 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:49:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:09,953 INFO L93 Difference]: Finished difference Result 3876 states and 5056 transitions. [2022-10-15 17:49:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:49:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-10-15 17:49:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:09,976 INFO L225 Difference]: With dead ends: 3876 [2022-10-15 17:49:09,976 INFO L226 Difference]: Without dead ends: 3876 [2022-10-15 17:49:09,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:09,977 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 166 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:09,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 447 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2022-10-15 17:49:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3626. [2022-10-15 17:49:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 2958 states have (on average 1.2734956051386073) internal successors, (3767), 2982 states have internal predecessors, (3767), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-10-15 17:49:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4722 transitions. [2022-10-15 17:49:10,099 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4722 transitions. Word has length 71 [2022-10-15 17:49:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,100 INFO L495 AbstractCegarLoop]: Abstraction has 3626 states and 4722 transitions. [2022-10-15 17:49:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:49:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4722 transitions. [2022-10-15 17:49:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-15 17:49:10,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,102 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] [2022-10-15 17:49:10,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:49:10,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1890265500, now seen corresponding path program 1 times [2022-10-15 17:49:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670171821] [2022-10-15 17:49:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 17:49:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:49:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670171821] [2022-10-15 17:49:10,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670171821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255953910] [2022-10-15 17:49:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:10,158 INFO L87 Difference]: Start difference. First operand 3626 states and 4722 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,242 INFO L93 Difference]: Finished difference Result 3888 states and 5107 transitions. [2022-10-15 17:49:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:49:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-10-15 17:49:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,265 INFO L225 Difference]: With dead ends: 3888 [2022-10-15 17:49:10,265 INFO L226 Difference]: Without dead ends: 3888 [2022-10-15 17:49:10,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:10,267 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 177 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 221 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3888 states. [2022-10-15 17:49:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3888 to 3557. [2022-10-15 17:49:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 2905 states have (on average 1.274354561101549) internal successors, (3702), 2928 states have internal predecessors, (3702), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2022-10-15 17:49:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4635 transitions. [2022-10-15 17:49:10,421 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4635 transitions. Word has length 71 [2022-10-15 17:49:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:10,421 INFO L495 AbstractCegarLoop]: Abstraction has 3557 states and 4635 transitions. [2022-10-15 17:49:10,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4635 transitions. [2022-10-15 17:49:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 17:49:10,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:10,424 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] [2022-10-15 17:49:10,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:49:10,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2123412382, now seen corresponding path program 1 times [2022-10-15 17:49:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418698234] [2022-10-15 17:49:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-15 17:49:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:49:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418698234] [2022-10-15 17:49:10,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418698234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:10,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:10,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:10,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238628726] [2022-10-15 17:49:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:10,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:10,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:10,521 INFO L87 Difference]: Start difference. First operand 3557 states and 4635 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:49:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:10,932 INFO L93 Difference]: Finished difference Result 7115 states and 9175 transitions. [2022-10-15 17:49:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:49:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2022-10-15 17:49:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:10,978 INFO L225 Difference]: With dead ends: 7115 [2022-10-15 17:49:10,978 INFO L226 Difference]: Without dead ends: 7115 [2022-10-15 17:49:10,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:49:10,980 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 649 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:10,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 803 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-10-15 17:49:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 6969. [2022-10-15 17:49:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6969 states, 5651 states have (on average 1.234117855246859) internal successors, (6974), 5714 states have internal predecessors, (6974), 778 states have call successors, (778), 481 states have call predecessors, (778), 538 states have return successors, (1179), 775 states have call predecessors, (1179), 775 states have call successors, (1179) [2022-10-15 17:49:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 8931 transitions. [2022-10-15 17:49:11,242 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 8931 transitions. Word has length 72 [2022-10-15 17:49:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:11,243 INFO L495 AbstractCegarLoop]: Abstraction has 6969 states and 8931 transitions. [2022-10-15 17:49:11,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:49:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 8931 transitions. [2022-10-15 17:49:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-15 17:49:11,247 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:11,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-10-15 17:49:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:49:11,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2089894278, now seen corresponding path program 1 times [2022-10-15 17:49:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:11,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513491353] [2022-10-15 17:49:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 17:49:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 17:49:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:49:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 17:49:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-15 17:49:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 17:49:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513491353] [2022-10-15 17:49:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513491353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329656534] [2022-10-15 17:49:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:11,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:11,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:11,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:49:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:11,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:11,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-15 17:49:11,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:11,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329656534] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:11,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:11,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-10-15 17:49:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362283378] [2022-10-15 17:49:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:11,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:11,592 INFO L87 Difference]: Start difference. First operand 6969 states and 8931 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 17:49:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:11,665 INFO L93 Difference]: Finished difference Result 6968 states and 8930 transitions. [2022-10-15 17:49:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:11,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2022-10-15 17:49:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:11,699 INFO L225 Difference]: With dead ends: 6968 [2022-10-15 17:49:11,699 INFO L226 Difference]: Without dead ends: 6783 [2022-10-15 17:49:11,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:11,701 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:11,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2022-10-15 17:49:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 6782. [2022-10-15 17:49:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6782 states, 5504 states have (on average 1.2185683139534884) internal successors, (6707), 5566 states have internal predecessors, (6707), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2022-10-15 17:49:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 8612 transitions. [2022-10-15 17:49:11,951 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 8612 transitions. Word has length 92 [2022-10-15 17:49:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:11,951 INFO L495 AbstractCegarLoop]: Abstraction has 6782 states and 8612 transitions. [2022-10-15 17:49:11,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 17:49:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 8612 transitions. [2022-10-15 17:49:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-15 17:49:11,961 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:11,961 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-10-15 17:49:12,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:12,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 17:49:12,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash -424028511, now seen corresponding path program 1 times [2022-10-15 17:49:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:12,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625304823] [2022-10-15 17:49:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-15 17:49:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 17:49:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:49:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 17:49:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 17:49:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-15 17:49:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-15 17:49:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-10-15 17:49:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:12,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625304823] [2022-10-15 17:49:12,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625304823] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:12,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016320027] [2022-10-15 17:49:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:12,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:12,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:49:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:12,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:12,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-15 17:49:12,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:12,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016320027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:12,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:12,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-10-15 17:49:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632132150] [2022-10-15 17:49:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:12,561 INFO L87 Difference]: Start difference. First operand 6782 states and 8612 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 17:49:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:12,597 INFO L93 Difference]: Finished difference Result 5157 states and 6460 transitions. [2022-10-15 17:49:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2022-10-15 17:49:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:12,621 INFO L225 Difference]: With dead ends: 5157 [2022-10-15 17:49:12,621 INFO L226 Difference]: Without dead ends: 4297 [2022-10-15 17:49:12,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:12,623 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:12,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2022-10-15 17:49:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2022-10-15 17:49:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2022-10-15 17:49:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2022-10-15 17:49:12,800 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2022-10-15 17:49:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:12,801 INFO L495 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2022-10-15 17:49:12,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 17:49:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2022-10-15 17:49:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-10-15 17:49:12,806 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:12,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:12,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 17:49:13,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:13,020 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash -366277057, now seen corresponding path program 1 times [2022-10-15 17:49:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57073907] [2022-10-15 17:49:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-15 17:49:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:49:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-15 17:49:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-15 17:49:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-15 17:49:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-15 17:49:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-15 17:49:13,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57073907] [2022-10-15 17:49:13,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57073907] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804338495] [2022-10-15 17:49:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:13,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:13,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:49:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:13,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 17:49:13,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804338495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-10-15 17:49:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457236007] [2022-10-15 17:49:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:13,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:13,384 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 17:49:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:13,422 INFO L93 Difference]: Finished difference Result 5190 states and 6402 transitions. [2022-10-15 17:49:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2022-10-15 17:49:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:13,441 INFO L225 Difference]: With dead ends: 5190 [2022-10-15 17:49:13,442 INFO L226 Difference]: Without dead ends: 5190 [2022-10-15 17:49:13,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:13,443 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:13,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-10-15 17:49:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-10-15 17:49:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2022-10-15 17:49:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2022-10-15 17:49:13,628 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2022-10-15 17:49:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:13,629 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2022-10-15 17:49:13,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 17:49:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2022-10-15 17:49:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-15 17:49:13,636 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:13,637 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:13,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:13,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 17:49:13,850 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2082419556, now seen corresponding path program 1 times [2022-10-15 17:49:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584014094] [2022-10-15 17:49:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-15 17:49:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:49:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-15 17:49:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-15 17:49:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-15 17:49:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 17:49:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-15 17:49:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-15 17:49:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-15 17:49:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584014094] [2022-10-15 17:49:14,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584014094] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842320126] [2022-10-15 17:49:14,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:14,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:14,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:49:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:14,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-15 17:49:14,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:14,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842320126] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:14,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:14,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-10-15 17:49:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937386704] [2022-10-15 17:49:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:14,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:14,196 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 17:49:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:14,256 INFO L93 Difference]: Finished difference Result 8722 states and 10597 transitions. [2022-10-15 17:49:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:14,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2022-10-15 17:49:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:14,287 INFO L225 Difference]: With dead ends: 8722 [2022-10-15 17:49:14,288 INFO L226 Difference]: Without dead ends: 8722 [2022-10-15 17:49:14,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:14,289 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:14,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-10-15 17:49:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2022-10-15 17:49:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2022-10-15 17:49:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2022-10-15 17:49:14,552 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2022-10-15 17:49:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:14,553 INFO L495 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2022-10-15 17:49:14,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 17:49:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2022-10-15 17:49:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-15 17:49:14,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:14,563 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:14,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:14,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:49:14,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1238414054, now seen corresponding path program 1 times [2022-10-15 17:49:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:14,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951785595] [2022-10-15 17:49:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-15 17:49:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:49:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-15 17:49:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-15 17:49:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-15 17:49:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 17:49:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-15 17:49:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-15 17:49:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-15 17:49:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951785595] [2022-10-15 17:49:15,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951785595] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619198422] [2022-10-15 17:49:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:15,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:15,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:15,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:49:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 17:49:15,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 17:49:15,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:15,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619198422] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:15,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:15,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-10-15 17:49:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168791207] [2022-10-15 17:49:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:15,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:49:15,167 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 17:49:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:15,235 INFO L93 Difference]: Finished difference Result 5407 states and 6549 transitions. [2022-10-15 17:49:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:49:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-10-15 17:49:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:15,253 INFO L225 Difference]: With dead ends: 5407 [2022-10-15 17:49:15,253 INFO L226 Difference]: Without dead ends: 5407 [2022-10-15 17:49:15,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:49:15,255 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:15,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 617 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2022-10-15 17:49:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5115. [2022-10-15 17:49:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2022-10-15 17:49:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2022-10-15 17:49:15,450 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2022-10-15 17:49:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:15,450 INFO L495 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2022-10-15 17:49:15,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-15 17:49:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2022-10-15 17:49:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-10-15 17:49:15,455 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:15,456 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:15,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 17:49:15,671 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1932612103, now seen corresponding path program 1 times [2022-10-15 17:49:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049651892] [2022-10-15 17:49:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 17:49:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:49:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 17:49:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 17:49:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-15 17:49:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:49:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-15 17:49:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-15 17:49:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-10-15 17:49:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:15,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049651892] [2022-10-15 17:49:15,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049651892] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:15,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:49:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263897726] [2022-10-15 17:49:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:15,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:49:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:15,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:49:15,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:15,901 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:16,025 INFO L93 Difference]: Finished difference Result 5025 states and 6074 transitions. [2022-10-15 17:49:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:49:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2022-10-15 17:49:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:16,043 INFO L225 Difference]: With dead ends: 5025 [2022-10-15 17:49:16,043 INFO L226 Difference]: Without dead ends: 5025 [2022-10-15 17:49:16,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:16,044 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:16,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2022-10-15 17:49:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2022-10-15 17:49:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2022-10-15 17:49:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2022-10-15 17:49:16,171 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2022-10-15 17:49:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:16,172 INFO L495 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2022-10-15 17:49:16,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2022-10-15 17:49:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-10-15 17:49:16,177 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:16,178 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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:49:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 17:49:16,178 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1247482381, now seen corresponding path program 1 times [2022-10-15 17:49:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715257863] [2022-10-15 17:49:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:49:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-15 17:49:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 17:49:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 17:49:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 17:49:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-15 17:49:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-10-15 17:49:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-10-15 17:49:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-15 17:49:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715257863] [2022-10-15 17:49:16,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715257863] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840360569] [2022-10-15 17:49:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:16,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:16,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 17:49:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:16,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:16,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-15 17:49:16,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:16,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840360569] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:16,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:16,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-10-15 17:49:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244625529] [2022-10-15 17:49:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:16,647 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:16,674 INFO L93 Difference]: Finished difference Result 4503 states and 5462 transitions. [2022-10-15 17:49:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2022-10-15 17:49:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:16,688 INFO L225 Difference]: With dead ends: 4503 [2022-10-15 17:49:16,689 INFO L226 Difference]: Without dead ends: 4503 [2022-10-15 17:49:16,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:16,690 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:16,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2022-10-15 17:49:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2022-10-15 17:49:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-10-15 17:49:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2022-10-15 17:49:16,792 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2022-10-15 17:49:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:16,792 INFO L495 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2022-10-15 17:49:16,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2022-10-15 17:49:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-10-15 17:49:16,796 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:16,796 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:49:16,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:17,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:17,011 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 593703412, now seen corresponding path program 1 times [2022-10-15 17:49:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:17,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920513336] [2022-10-15 17:49:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:49:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-15 17:49:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 17:49:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 17:49:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 17:49:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-15 17:49:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-10-15 17:49:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-10-15 17:49:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-10-15 17:49:17,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:17,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920513336] [2022-10-15 17:49:17,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920513336] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:17,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678112818] [2022-10-15 17:49:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:17,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:17,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 17:49:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:17,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 17:49:17,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:17,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678112818] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:17,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:17,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-10-15 17:49:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705888166] [2022-10-15 17:49:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:17,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:17,292 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:17,332 INFO L93 Difference]: Finished difference Result 4330 states and 5201 transitions. [2022-10-15 17:49:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2022-10-15 17:49:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:17,349 INFO L225 Difference]: With dead ends: 4330 [2022-10-15 17:49:17,349 INFO L226 Difference]: Without dead ends: 4330 [2022-10-15 17:49:17,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:17,350 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:17,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 301 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-10-15 17:49:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2022-10-15 17:49:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-10-15 17:49:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2022-10-15 17:49:17,490 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2022-10-15 17:49:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:17,491 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2022-10-15 17:49:17,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2022-10-15 17:49:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-10-15 17:49:17,496 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:17,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:49:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:17,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:17,710 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 807604099, now seen corresponding path program 1 times [2022-10-15 17:49:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:17,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936422807] [2022-10-15 17:49:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:49:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:49:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-15 17:49:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 17:49:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-15 17:49:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-15 17:49:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-15 17:49:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-15 17:49:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-10-15 17:49:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-15 17:49:17,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936422807] [2022-10-15 17:49:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936422807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:17,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872982800] [2022-10-15 17:49:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:17,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:17,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:17,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:17,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:17,943 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:18,390 INFO L93 Difference]: Finished difference Result 7213 states and 9056 transitions. [2022-10-15 17:49:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:49:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2022-10-15 17:49:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:18,416 INFO L225 Difference]: With dead ends: 7213 [2022-10-15 17:49:18,417 INFO L226 Difference]: Without dead ends: 6881 [2022-10-15 17:49:18,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:49:18,418 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 430 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:18,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 802 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2022-10-15 17:49:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4783. [2022-10-15 17:49:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4052 states have (on average 1.1581934846989141) internal successors, (4693), 4067 states have internal predecessors, (4693), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2022-10-15 17:49:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 5731 transitions. [2022-10-15 17:49:18,565 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 5731 transitions. Word has length 165 [2022-10-15 17:49:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:18,566 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 5731 transitions. [2022-10-15 17:49:18,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 17:49:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 5731 transitions. [2022-10-15 17:49:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-10-15 17:49:18,570 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:18,570 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:18,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 17:49:18,571 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1349603078, now seen corresponding path program 1 times [2022-10-15 17:49:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376137031] [2022-10-15 17:49:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-10-15 17:49:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 17:49:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-15 17:49:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-10-15 17:49:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-15 17:49:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-10-15 17:49:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376137031] [2022-10-15 17:49:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376137031] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792951138] [2022-10-15 17:49:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:18,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:18,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 17:49:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:18,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:18,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 17:49:18,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:18,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792951138] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:18,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:18,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 17:49:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395478385] [2022-10-15 17:49:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:18,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:18,941 INFO L87 Difference]: Start difference. First operand 4783 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:18,975 INFO L93 Difference]: Finished difference Result 4283 states and 5049 transitions. [2022-10-15 17:49:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-10-15 17:49:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:18,988 INFO L225 Difference]: With dead ends: 4283 [2022-10-15 17:49:18,988 INFO L226 Difference]: Without dead ends: 4169 [2022-10-15 17:49:18,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:18,990 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:18,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2022-10-15 17:49:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3893. [2022-10-15 17:49:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.15333534560821) internal successors, (3821), 3324 states have internal predecessors, (3821), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-10-15 17:49:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4594 transitions. [2022-10-15 17:49:19,106 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4594 transitions. Word has length 170 [2022-10-15 17:49:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:19,107 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4594 transitions. [2022-10-15 17:49:19,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4594 transitions. [2022-10-15 17:49:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-10-15 17:49:19,111 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:19,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:19,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:19,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:19,327 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1297306909, now seen corresponding path program 1 times [2022-10-15 17:49:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:19,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877419421] [2022-10-15 17:49:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-10-15 17:49:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-15 17:49:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-15 17:49:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-10-15 17:49:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-10-15 17:49:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-10-15 17:49:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877419421] [2022-10-15 17:49:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877419421] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355672408] [2022-10-15 17:49:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:19,465 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:19,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 17:49:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:19,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:19,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 17:49:19,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:19,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355672408] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:19,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:19,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-10-15 17:49:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076119056] [2022-10-15 17:49:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:19,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:19,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:19,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:19,643 INFO L87 Difference]: Start difference. First operand 3893 states and 4594 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:19,672 INFO L93 Difference]: Finished difference Result 3896 states and 4583 transitions. [2022-10-15 17:49:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-10-15 17:49:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:19,684 INFO L225 Difference]: With dead ends: 3896 [2022-10-15 17:49:19,684 INFO L226 Difference]: Without dead ends: 3896 [2022-10-15 17:49:19,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:19,685 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:19,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-10-15 17:49:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2022-10-15 17:49:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.1494114095985513) internal successors, (3808), 3324 states have internal predecessors, (3808), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-10-15 17:49:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4581 transitions. [2022-10-15 17:49:19,767 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4581 transitions. Word has length 170 [2022-10-15 17:49:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:19,768 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4581 transitions. [2022-10-15 17:49:19,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-15 17:49:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4581 transitions. [2022-10-15 17:49:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-10-15 17:49:19,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:19,772 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:19,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:19,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-15 17:49:19,985 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1999656671, now seen corresponding path program 1 times [2022-10-15 17:49:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:19,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282753058] [2022-10-15 17:49:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:49:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 17:49:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-15 17:49:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-15 17:49:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-10-15 17:49:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-10-15 17:49:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:20,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282753058] [2022-10-15 17:49:20,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282753058] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:20,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772589478] [2022-10-15 17:49:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:20,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:20,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:20,275 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 17:49:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:20,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 17:49:20,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-10-15 17:49:20,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:49:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-10-15 17:49:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772589478] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:49:21,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:49:21,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-10-15 17:49:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158714930] [2022-10-15 17:49:21,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:49:21,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:21,107 INFO L87 Difference]: Start difference. First operand 3893 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-10-15 17:49:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:21,458 INFO L93 Difference]: Finished difference Result 5794 states and 7097 transitions. [2022-10-15 17:49:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:49:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-10-15 17:49:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:21,479 INFO L225 Difference]: With dead ends: 5794 [2022-10-15 17:49:21,479 INFO L226 Difference]: Without dead ends: 5794 [2022-10-15 17:49:21,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:49:21,480 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 250 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:21,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1108 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:49:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2022-10-15 17:49:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4184. [2022-10-15 17:49:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 3559 states have (on average 1.1469513908401237) internal successors, (4082), 3570 states have internal predecessors, (4082), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2022-10-15 17:49:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4911 transitions. [2022-10-15 17:49:21,592 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4911 transitions. Word has length 172 [2022-10-15 17:49:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:21,593 INFO L495 AbstractCegarLoop]: Abstraction has 4184 states and 4911 transitions. [2022-10-15 17:49:21,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-10-15 17:49:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4911 transitions. [2022-10-15 17:49:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-10-15 17:49:21,602 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:21,603 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-15 17:49:21,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:21,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-10-15 17:49:21,816 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 749595411, now seen corresponding path program 1 times [2022-10-15 17:49:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:21,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864018041] [2022-10-15 17:49:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:49:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 17:49:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-15 17:49:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-15 17:49:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-10-15 17:49:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-15 17:49:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-10-15 17:49:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-15 17:49:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-10-15 17:49:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-10-15 17:49:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-15 17:49:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-10-15 17:49:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-10-15 17:49:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 113 proven. 30 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-10-15 17:49:22,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:22,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864018041] [2022-10-15 17:49:22,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864018041] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:22,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231071969] [2022-10-15 17:49:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:22,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:22,046 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 17:49:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:22,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-10-15 17:49:22,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:22,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231071969] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:22,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:22,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-15 17:49:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543157240] [2022-10-15 17:49:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:22,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:22,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:22,268 INFO L87 Difference]: Start difference. First operand 4184 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-15 17:49:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:22,307 INFO L93 Difference]: Finished difference Result 6523 states and 7599 transitions. [2022-10-15 17:49:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:22,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 252 [2022-10-15 17:49:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:22,327 INFO L225 Difference]: With dead ends: 6523 [2022-10-15 17:49:22,327 INFO L226 Difference]: Without dead ends: 6523 [2022-10-15 17:49:22,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:22,328 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:22,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2022-10-15 17:49:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6406. [2022-10-15 17:49:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5441 states have (on average 1.139680205844514) internal successors, (6201), 5452 states have internal predecessors, (6201), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2022-10-15 17:49:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7473 transitions. [2022-10-15 17:49:22,502 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7473 transitions. Word has length 252 [2022-10-15 17:49:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:22,503 INFO L495 AbstractCegarLoop]: Abstraction has 6406 states and 7473 transitions. [2022-10-15 17:49:22,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-10-15 17:49:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7473 transitions. [2022-10-15 17:49:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-10-15 17:49:22,514 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:22,514 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-15 17:49:22,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:22,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-15 17:49:22,729 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 416952273, now seen corresponding path program 1 times [2022-10-15 17:49:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058116505] [2022-10-15 17:49:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 17:49:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 17:49:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 17:49:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-15 17:49:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-15 17:49:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:49:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:49:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 17:49:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-15 17:49:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-15 17:49:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-10-15 17:49:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-15 17:49:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-10-15 17:49:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-15 17:49:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-10-15 17:49:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-10-15 17:49:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-15 17:49:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-10-15 17:49:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-10-15 17:49:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-10-15 17:49:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:22,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058116505] [2022-10-15 17:49:22,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058116505] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:22,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420286621] [2022-10-15 17:49:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:22,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:22,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:22,863 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 17:49:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:22,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:22,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-10-15 17:49:23,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:23,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420286621] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:23,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:23,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-10-15 17:49:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865593249] [2022-10-15 17:49:23,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:23,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:23,028 INFO L87 Difference]: Start difference. First operand 6406 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-15 17:49:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:23,047 INFO L93 Difference]: Finished difference Result 2546 states and 2894 transitions. [2022-10-15 17:49:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2022-10-15 17:49:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:23,054 INFO L225 Difference]: With dead ends: 2546 [2022-10-15 17:49:23,054 INFO L226 Difference]: Without dead ends: 2546 [2022-10-15 17:49:23,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:49:23,055 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:23,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-10-15 17:49:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2022-10-15 17:49:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2145 states have (on average 1.116083916083916) internal successors, (2394), 2158 states have internal predecessors, (2394), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2022-10-15 17:49:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2894 transitions. [2022-10-15 17:49:23,105 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2894 transitions. Word has length 252 [2022-10-15 17:49:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:23,106 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 2894 transitions. [2022-10-15 17:49:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-15 17:49:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2894 transitions. [2022-10-15 17:49:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-10-15 17:49:23,113 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:23,113 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-15 17:49:23,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:23,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-15 17:49:23,326 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash 378450938, now seen corresponding path program 1 times [2022-10-15 17:49:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:23,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501316257] [2022-10-15 17:49:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:49:23,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:49:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:49:23,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:49:23,497 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:49:23,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:49:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:49:23,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-15 17:49:23,505 INFO L444 BasicCegarLoop]: Path program 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] [2022-10-15 17:49:23,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:49:23,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:49:23 BoogieIcfgContainer [2022-10-15 17:49:23,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:49:23,767 INFO L158 Benchmark]: Toolchain (without parser) took 21786.24ms. Allocated memory was 154.1MB in the beginning and 420.5MB in the end (delta: 266.3MB). Free memory was 127.5MB in the beginning and 216.5MB in the end (delta: -89.0MB). Peak memory consumption was 178.0MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,768 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 154.1MB. Free memory was 123.7MB in the beginning and 123.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:49:23,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.22ms. Allocated memory is still 154.1MB. Free memory was 127.4MB in the beginning and 114.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 154.1MB. Free memory was 114.6MB in the beginning and 112.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,770 INFO L158 Benchmark]: Boogie Preprocessor took 41.73ms. Allocated memory is still 154.1MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,772 INFO L158 Benchmark]: RCFGBuilder took 730.92ms. Allocated memory is still 154.1MB. Free memory was 110.7MB in the beginning and 124.9MB in the end (delta: -14.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,773 INFO L158 Benchmark]: TraceAbstraction took 20439.11ms. Allocated memory was 154.1MB in the beginning and 420.5MB in the end (delta: 266.3MB). Free memory was 124.4MB in the beginning and 216.5MB in the end (delta: -92.2MB). Peak memory consumption was 174.2MB. Max. memory is 8.0GB. [2022-10-15 17:49:23,781 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.26ms. Allocated memory is still 154.1MB. Free memory was 123.7MB in the beginning and 123.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 499.22ms. Allocated memory is still 154.1MB. Free memory was 127.4MB in the beginning and 114.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 154.1MB. Free memory was 114.6MB in the beginning and 112.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.73ms. Allocated memory is still 154.1MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 730.92ms. Allocated memory is still 154.1MB. Free memory was 110.7MB in the beginning and 124.9MB in the end (delta: -14.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * TraceAbstraction took 20439.11ms. Allocated memory was 154.1MB in the beginning and 420.5MB in the end (delta: 266.3MB). Free memory was 124.4MB in the beginning and 216.5MB in the end (delta: -92.2MB). Peak memory consumption was 174.2MB. 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L441] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - UnprovableResult [Line: 499]: 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 7 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 27, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5195 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5043 mSDsluCounter, 13077 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7770 mSDsCounter, 757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2872 IncrementalHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 757 mSolverCounterUnsat, 5307 mSDtfsCounter, 2872 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2999 GetRequests, 2830 SyntacticMatches, 5 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8718occurred in iteration=16, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 7900 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 5368 NumberOfCodeBlocks, 5368 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5224 ConstructedInterpolants, 0 QuantifiedInterpolants, 9641 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5781 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 40 InterpolantComputations, 25 PerfectInterpolantSequences, 4350/4640 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:49:23,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...