/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-time-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:19:18,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:19:18,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:19:18,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:19:18,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:19:18,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:19:18,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:19:18,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:19:18,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:19:18,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:19:18,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:19:18,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:19:18,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:19:18,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:19:18,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:19:18,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:19:18,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:19:18,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:19:18,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:19:18,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:19:18,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:19:18,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:19:18,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:19:18,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:19:18,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:19:18,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:19:18,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:19:18,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:19:18,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:19:18,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:19:18,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:19:18,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:19:18,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:19:18,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:19:18,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:19:18,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:19:18,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:19:18,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:19:18,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:19:18,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:19:18,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:19:18,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:19:18,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:19:18,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:19:18,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:19:18,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:19:18,966 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:19:18,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:19:18,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:19:18,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:19:18,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:19:18,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:19:18,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:19:18,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:19:18,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:19:18,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:19:18,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:19:18,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:19:18,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:19:18,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:19:18,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:19:18,970 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:19:18,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:19:18,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:19:18,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:19:18,970 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-12-13 10:19:19,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:19:19,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:19:19,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:19:19,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:19:19,281 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:19:19,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-trans.wvr.c [2022-12-13 10:19:20,293 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:19:20,484 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:19:20,484 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-trans.wvr.c [2022-12-13 10:19:20,509 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec95c66fd/0c5862a9180e4253bb22d0fba605ef92/FLAG440ede000 [2022-12-13 10:19:20,523 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec95c66fd/0c5862a9180e4253bb22d0fba605ef92 [2022-12-13 10:19:20,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:19:20,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:19:20,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:19:20,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:19:20,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:19:20,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cab2f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20, skipping insertion in model container [2022-12-13 10:19:20,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:19:20,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:19:20,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,691 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-trans.wvr.c[2836,2849] [2022-12-13 10:19:20,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:19:20,708 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:19:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:19:20,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:19:20,739 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-trans.wvr.c[2836,2849] [2022-12-13 10:19:20,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:19:20,753 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:19:20,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20 WrapperNode [2022-12-13 10:19:20,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:19:20,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:19:20,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:19:20,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:19:20,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,805 INFO L138 Inliner]: procedures = 23, calls = 39, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 214 [2022-12-13 10:19:20,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:19:20,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:19:20,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:19:20,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:19:20,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:19:20,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:19:20,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:19:20,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:19:20,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (1/1) ... [2022-12-13 10:19:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:19:20,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:19:20,857 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-12-13 10:19:20,864 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-12-13 10:19:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:19:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:19:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:19:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:19:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:19:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:19:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:19:20,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:19:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:19:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:19:20,887 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:19:20,967 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:19:20,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:19:21,306 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:19:21,532 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:19:21,532 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 10:19:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:19:21 BoogieIcfgContainer [2022-12-13 10:19:21,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:19:21,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:19:21,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:19:21,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:19:21,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:19:20" (1/3) ... [2022-12-13 10:19:21,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79c5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:19:21, skipping insertion in model container [2022-12-13 10:19:21,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:19:20" (2/3) ... [2022-12-13 10:19:21,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79c5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:19:21, skipping insertion in model container [2022-12-13 10:19:21,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:19:21" (3/3) ... [2022-12-13 10:19:21,540 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2022-12-13 10:19:21,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:19:21,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:19:21,552 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:19:21,592 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:19:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 105 transitions, 234 flow [2022-12-13 10:19:21,687 INFO L130 PetriNetUnfolder]: 1/102 cut-off events. [2022-12-13 10:19:21,687 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:19:21,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 1/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2022-12-13 10:19:21,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 105 transitions, 234 flow [2022-12-13 10:19:21,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 92 transitions, 202 flow [2022-12-13 10:19:21,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:21,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 92 transitions, 202 flow [2022-12-13 10:19:21,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 92 transitions, 202 flow [2022-12-13 10:19:21,742 INFO L130 PetriNetUnfolder]: 1/92 cut-off events. [2022-12-13 10:19:21,742 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:19:21,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 1/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 19 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2022-12-13 10:19:21,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 92 transitions, 202 flow [2022-12-13 10:19:21,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 10:19:25,845 INFO L241 LiptonReduction]: Total number of compositions: 76 [2022-12-13 10:19:25,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:19:25,859 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41730e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:19:25,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:19:25,863 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 10:19:25,863 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:19:25,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:25,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:19:25,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:19:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -330264479, now seen corresponding path program 1 times [2022-12-13 10:19:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800263447] [2022-12-13 10:19:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800263447] [2022-12-13 10:19:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800263447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:26,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:26,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:19:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923495131] [2022-12-13 10:19:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:19:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:19:26,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:19:26,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:19:26,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:26,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:26,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:19:26,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:26,969 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 10:19:26,969 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 10:19:26,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 274 event pairs, 17 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 130. Up to 45 conditions per place. [2022-12-13 10:19:26,971 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 28 selfloop transitions, 2 changer transitions 7/37 dead transitions. [2022-12-13 10:19:26,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 37 transitions, 190 flow [2022-12-13 10:19:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:19:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:19:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 10:19:26,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 10:19:26,980 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 5 states and 38 transitions. [2022-12-13 10:19:26,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 37 transitions, 190 flow [2022-12-13 10:19:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:19:26,984 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 53 flow [2022-12-13 10:19:26,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=53, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-13 10:19:26,987 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-13 10:19:26,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:26,988 INFO L89 Accepts]: Start accepts. Operand has 27 places, 17 transitions, 53 flow [2022-12-13 10:19:26,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:26,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:26,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 53 flow [2022-12-13 10:19:26,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 53 flow [2022-12-13 10:19:26,995 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 10:19:26,995 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:19:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 27 events. 0/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 10:19:27,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 53 flow [2022-12-13 10:19:27,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 10:19:27,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse2 (<= v_~ora_0~0_41 (+ 2147483647 v_~ora_4~0_41)))) (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (let ((.cse0 (= v_~ora_0~0_41 v_~ora_4~0_41))) (or (and (= |v_thread3_#t~ret8#1_39| v_~cmp_8~0_69) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| |v_thread3Thread1of1ForFork1_minus_#in~a#1_7|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (or (<= |v_thread3Thread1of1ForFork1_minus_~a#1_7| (+ |v_thread3Thread1of1ForFork1_minus_~b#1_7| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork1_minus_~b#1_7|)) 1 0)) (= |v_thread3_#t~ret8#1_39| |v_thread3Thread1of1ForFork1_minus_#res#1_7|) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| (+ |v_thread3Thread1of1ForFork1_minus_~b#1_7| |v_thread3Thread1of1ForFork1_minus_#res#1_7|)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread3Thread1of1ForFork1_minus_~b#1_7| |v_thread3Thread1of1ForFork1_minus_#in~b#1_7|) (<= |v_thread3_#t~ret8#1_39| 2147483647) .cse0 (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_7| v_~volume_totale_5~0_57) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_7| v_~volume_totale_1~0_53) (<= 0 (+ |v_thread3_#t~ret8#1_39| 2147483648))) (let ((.cse1 (ite (or (<= 0 v_~ora_4~0_41) .cse2) 1 0))) (and (= .cse1 |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread3Thread1of1ForFork1_minus_~b#1_7| v_~ora_4~0_41) (= v_~ora_0~0_41 (+ |v_thread3Thread1of1ForFork1_minus_#res#1_7| v_~ora_4~0_41)) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_7| v_~ora_4~0_41) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| v_~ora_0~0_41) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| .cse1) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_7| v_~ora_0~0_41) (= |v_thread3Thread1of1ForFork1_#t~ret8#1_10| |v_thread3_#t~ret8#1_39|) (= (+ v_~cmp_8~0_69 v_~ora_4~0_41) v_~ora_0~0_41) (not .cse0))))) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (<= v_~ora_4~0_41 (+ v_~ora_0~0_41 2147483648)) .cse2)) InVars {~ora_0~0=v_~ora_0~0_41, thread3Thread1of1ForFork1_#t~ret8#1=|v_thread3Thread1of1ForFork1_#t~ret8#1_10|, ~ora_4~0=v_~ora_4~0_41, ~volume_totale_5~0=v_~volume_totale_5~0_57, ~volume_totale_1~0=v_~volume_totale_1~0_53} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread3Thread1of1ForFork1_#t~ret7#1=|v_thread3Thread1of1ForFork1_#t~ret7#1_7|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread3Thread1of1ForFork1_minus_~a#1=|v_thread3Thread1of1ForFork1_minus_~a#1_7|, ~ora_4~0=v_~ora_4~0_41, ~volume_totale_5~0=v_~volume_totale_5~0_57, thread3Thread1of1ForFork1_minus_#in~b#1=|v_thread3Thread1of1ForFork1_minus_#in~b#1_7|, ~volume_totale_1~0=v_~volume_totale_1~0_53, ~cmp_8~0=v_~cmp_8~0_69, ~ora_0~0=v_~ora_0~0_41, thread3Thread1of1ForFork1_minus_#res#1=|v_thread3Thread1of1ForFork1_minus_#res#1_7|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_minus_~b#1=|v_thread3Thread1of1ForFork1_minus_~b#1_7|, thread3Thread1of1ForFork1_minus_#in~a#1=|v_thread3Thread1of1ForFork1_minus_#in~a#1_7|} AuxVars[|v_thread3_#t~ret8#1_39|] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~ret7#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_minus_~a#1, thread3Thread1of1ForFork1_minus_#in~b#1, ~cmp_8~0, thread3Thread1of1ForFork1_minus_#res#1, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~ite9#1, thread3Thread1of1ForFork1_#t~ret8#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_minus_~b#1, thread3Thread1of1ForFork1_minus_#in~a#1] and [654] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (<= v_~ora_0~0_45 (+ 2147483647 v_~ora_2~0_39)))) (and (<= v_~ora_2~0_39 (+ v_~ora_0~0_45 2147483648)) .cse0 (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (let ((.cse1 (= v_~ora_0~0_45 v_~ora_2~0_39))) (or (and (<= |v_thread1_#t~ret2#1_57| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_5| |v_thread1Thread1of1ForFork2_minus_~a#1_5|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_5| |v_thread1Thread1of1ForFork2_minus_~b#1_5|) (= |v_thread1_#t~ret2#1_57| v_~cmp_6~0_73) (= v_~volume_totale_3~0_77 |v_thread1Thread1of1ForFork2_minus_#in~b#1_5|) (= |v_thread1_#t~ret2#1_57| |v_thread1Thread1of1ForFork2_minus_#res#1_5|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= v_~volume_totale_1~0_59 |v_thread1Thread1of1ForFork2_minus_#in~a#1_5|) (<= 0 (+ |v_thread1_#t~ret2#1_57| 2147483648)) .cse1 (= (+ |v_thread1Thread1of1ForFork2_minus_#res#1_5| |v_thread1Thread1of1ForFork2_minus_~b#1_5|) |v_thread1Thread1of1ForFork2_minus_~a#1_5|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_5|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_5| (+ 2147483647 |v_thread1Thread1of1ForFork2_minus_~b#1_5|))) 1 0))) (let ((.cse2 (ite (or .cse0 (<= 0 v_~ora_2~0_39)) 1 0))) (and (= (+ v_~cmp_6~0_73 v_~ora_2~0_39) v_~ora_0~0_45) (= v_~ora_0~0_45 |v_thread1Thread1of1ForFork2_minus_~a#1_5|) (= v_~ora_2~0_39 |v_thread1Thread1of1ForFork2_minus_~b#1_5|) (= .cse2 |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|) (= v_~ora_2~0_39 |v_thread1Thread1of1ForFork2_minus_#in~b#1_5|) (= (+ |v_thread1Thread1of1ForFork2_minus_#res#1_5| v_~ora_2~0_39) v_~ora_0~0_45) (= |v_thread1_#t~ret2#1_57| |v_thread1Thread1of1ForFork2_#t~ret2#1_6|) (= .cse2 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (not .cse1) (= v_~ora_0~0_45 |v_thread1Thread1of1ForFork2_minus_#in~a#1_5|))))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0))) InVars {~ora_0~0=v_~ora_0~0_45, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_6|, ~volume_totale_3~0=v_~volume_totale_3~0_77, ~ora_2~0=v_~ora_2~0_39, ~volume_totale_1~0=v_~volume_totale_1~0_59} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_5|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_5|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_5|, ~volume_totale_3~0=v_~volume_totale_3~0_77, ~ora_2~0=v_~ora_2~0_39, ~cmp_6~0=v_~cmp_6~0_73, ~volume_totale_1~0=v_~volume_totale_1~0_59, ~ora_0~0=v_~ora_0~0_45, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_5|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_5|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_5|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_5|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[|v_thread1_#t~ret2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_minus_#res#1, ~cmp_6~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 10:19:27,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:19:27,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-13 10:19:27,494 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 56 flow [2022-12-13 10:19:27,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:27,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:27,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:19:27,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:19:27,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:19:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2530013, now seen corresponding path program 2 times [2022-12-13 10:19:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:27,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722749246] [2022-12-13 10:19:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:27,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722749246] [2022-12-13 10:19:27,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722749246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:27,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:27,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:19:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550642913] [2022-12-13 10:19:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:27,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:19:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:19:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:19:27,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 10:19:27,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 56 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:27,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:27,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 10:19:27,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:28,057 INFO L130 PetriNetUnfolder]: 38/116 cut-off events. [2022-12-13 10:19:28,057 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-12-13 10:19:28,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 116 events. 38/116 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 411 event pairs, 13 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 292. Up to 58 conditions per place. [2022-12-13 10:19:28,059 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 27 selfloop transitions, 3 changer transitions 10/40 dead transitions. [2022-12-13 10:19:28,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 201 flow [2022-12-13 10:19:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:19:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:19:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 10:19:28,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-13 10:19:28,061 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 56 flow. Second operand 5 states and 41 transitions. [2022-12-13 10:19:28,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 201 flow [2022-12-13 10:19:28,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 193 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:19:28,064 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 72 flow [2022-12-13 10:19:28,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-12-13 10:19:28,065 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-13 10:19:28,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:28,066 INFO L89 Accepts]: Start accepts. Operand has 31 places, 18 transitions, 72 flow [2022-12-13 10:19:28,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:28,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:28,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 18 transitions, 72 flow [2022-12-13 10:19:28,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 72 flow [2022-12-13 10:19:28,079 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 10:19:28,079 INFO L131 PetriNetUnfolder]: For 39/50 co-relation queries the response was YES. [2022-12-13 10:19:28,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 39 events. 0/39 cut-off events. For 39/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 10:19:28,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 72 flow [2022-12-13 10:19:28,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 10:19:28,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:19:28,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 10:19:28,106 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 72 flow [2022-12-13 10:19:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:28,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:28,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:19:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:19:28,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:19:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1011923191, now seen corresponding path program 1 times [2022-12-13 10:19:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811944291] [2022-12-13 10:19:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811944291] [2022-12-13 10:19:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811944291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:28,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:28,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:19:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216171735] [2022-12-13 10:19:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:28,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:19:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:19:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:19:28,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 10:19:28,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 72 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:28,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:28,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 10:19:28,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:28,546 INFO L130 PetriNetUnfolder]: 33/103 cut-off events. [2022-12-13 10:19:28,546 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2022-12-13 10:19:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 103 events. 33/103 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 332 event pairs, 14 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 316. Up to 60 conditions per place. [2022-12-13 10:19:28,548 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 22 selfloop transitions, 2 changer transitions 8/32 dead transitions. [2022-12-13 10:19:28,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 187 flow [2022-12-13 10:19:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:19:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:19:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 10:19:28,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 10:19:28,549 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 72 flow. Second operand 4 states and 32 transitions. [2022-12-13 10:19:28,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 187 flow [2022-12-13 10:19:28,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 175 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 10:19:28,551 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 60 flow [2022-12-13 10:19:28,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2022-12-13 10:19:28,553 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-13 10:19:28,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:28,553 INFO L89 Accepts]: Start accepts. Operand has 32 places, 17 transitions, 60 flow [2022-12-13 10:19:28,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:28,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:28,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 17 transitions, 60 flow [2022-12-13 10:19:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 17 transitions, 60 flow [2022-12-13 10:19:28,559 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 10:19:28,559 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 10:19:28,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 29 events. 0/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 10:19:28,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 60 flow [2022-12-13 10:19:28,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 10:19:28,561 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:28,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 10:19:28,565 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 60 flow [2022-12-13 10:19:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:28,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:28,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:19:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:19:28,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:19:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 809733537, now seen corresponding path program 3 times [2022-12-13 10:19:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944001406] [2022-12-13 10:19:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:28,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944001406] [2022-12-13 10:19:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944001406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:28,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:19:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838530806] [2022-12-13 10:19:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:28,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:19:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:19:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:19:28,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:19:28,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 60 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:28,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:28,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:19:28,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:29,113 INFO L130 PetriNetUnfolder]: 31/89 cut-off events. [2022-12-13 10:19:29,113 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-13 10:19:29,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 89 events. 31/89 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 9 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 274. Up to 37 conditions per place. [2022-12-13 10:19:29,114 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 22 selfloop transitions, 2 changer transitions 11/35 dead transitions. [2022-12-13 10:19:29,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 183 flow [2022-12-13 10:19:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:19:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:19:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 10:19:29,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 10:19:29,115 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 60 flow. Second operand 5 states and 36 transitions. [2022-12-13 10:19:29,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 183 flow [2022-12-13 10:19:29,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 10:19:29,116 INFO L231 Difference]: Finished difference. Result has 32 places, 16 transitions, 55 flow [2022-12-13 10:19:29,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55, PETRI_PLACES=32, PETRI_TRANSITIONS=16} [2022-12-13 10:19:29,116 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-13 10:19:29,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:19:29,116 INFO L89 Accepts]: Start accepts. Operand has 32 places, 16 transitions, 55 flow [2022-12-13 10:19:29,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:19:29,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:29,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 16 transitions, 55 flow [2022-12-13 10:19:29,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 16 transitions, 55 flow [2022-12-13 10:19:29,120 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-13 10:19:29,120 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-12-13 10:19:29,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 20 events. 0/20 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 10:19:29,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 16 transitions, 55 flow [2022-12-13 10:19:29,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-13 10:19:29,121 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:29,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 10:19:29,121 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 55 flow [2022-12-13 10:19:29,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:29,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:19:29,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:19:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:19:29,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:19:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:19:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1870297103, now seen corresponding path program 4 times [2022-12-13 10:19:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:19:29,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357234980] [2022-12-13 10:19:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:19:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:19:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:19:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:19:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:19:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357234980] [2022-12-13 10:19:29,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357234980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:19:29,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:19:29,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:19:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32676507] [2022-12-13 10:19:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:19:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:19:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:19:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:19:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:19:29,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:19:29,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 16 transitions, 55 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:29,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:19:29,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:19:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:19:29,509 INFO L130 PetriNetUnfolder]: 19/57 cut-off events. [2022-12-13 10:19:29,510 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 10:19:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 57 events. 19/57 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 111 event pairs, 8 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 189. Up to 28 conditions per place. [2022-12-13 10:19:29,510 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2022-12-13 10:19:29,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 158 flow [2022-12-13 10:19:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:19:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:19:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-12-13 10:19:29,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-13 10:19:29,511 INFO L175 Difference]: Start difference. First operand has 30 places, 16 transitions, 55 flow. Second operand 5 states and 31 transitions. [2022-12-13 10:19:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 158 flow [2022-12-13 10:19:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 146 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:19:29,512 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-13 10:19:29,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-13 10:19:29,512 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-13 10:19:29,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:19:29,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-13 10:19:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 10:19:29,513 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 10:19:29,513 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:19:29,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 10:19:29,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 10:19:29,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 10:19:29,513 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:19:29,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 10:19:29,514 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 10:19:29,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:19:29,515 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:19:29,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:19:29,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:19:29,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:19:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:19:29,516 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 10:19:29,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:19:29,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:19:29,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:19:29 BasicIcfg [2022-12-13 10:19:29,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:19:29,520 INFO L158 Benchmark]: Toolchain (without parser) took 8994.37ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 174.9MB in the beginning and 215.6MB in the end (delta: -40.7MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,520 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 110.0MB in the beginning and 109.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:19:29,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.87ms. Allocated memory is still 199.2MB. Free memory was 174.7MB in the beginning and 162.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 160.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,521 INFO L158 Benchmark]: Boogie Preprocessor took 23.62ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 158.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,521 INFO L158 Benchmark]: RCFGBuilder took 703.56ms. Allocated memory is still 199.2MB. Free memory was 158.7MB in the beginning and 169.8MB in the end (delta: -11.1MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,521 INFO L158 Benchmark]: TraceAbstraction took 7983.82ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 168.3MB in the beginning and 215.6MB in the end (delta: -47.3MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. [2022-12-13 10:19:29,522 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.09ms. Allocated memory is still 127.9MB. Free memory was 110.0MB in the beginning and 109.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.87ms. Allocated memory is still 199.2MB. Free memory was 174.7MB in the beginning and 162.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 160.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.62ms. Allocated memory is still 199.2MB. Free memory was 160.5MB in the beginning and 158.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 703.56ms. Allocated memory is still 199.2MB. Free memory was 158.7MB in the beginning and 169.8MB in the end (delta: -11.1MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7983.82ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 168.3MB in the beginning and 215.6MB in the end (delta: -47.3MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 101 PlacesBefore, 26 PlacesAfterwards, 92 TransitionsBefore, 16 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 18 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 117, unknown conditional: 117, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 117, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 26 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 6, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 31 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 120 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 10:19:29,547 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...