/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:52:59,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:52:59,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:52:59,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:52:59,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:52:59,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:52:59,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:52:59,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:52:59,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:52:59,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:52:59,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:52:59,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:52:59,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:52:59,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:52:59,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:52:59,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:52:59,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:52:59,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:52:59,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:52:59,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:52:59,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:52:59,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:52:59,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:52:59,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:52:59,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:52:59,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:52:59,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:52:59,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:52:59,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:52:59,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:52:59,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:52:59,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:52:59,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:52:59,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:52:59,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:52:59,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:52:59,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:52:59,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:52:59,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:52:59,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:52:59,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:52:59,647 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-NoLbe.epf [2022-12-05 19:52:59,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:52:59,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:52:59,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:52:59,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:52:59,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:52:59,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:52:59,682 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:52:59,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:52:59,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:52:59,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:52:59,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:52:59,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:52:59,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:52:59,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:52:59,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:52:59,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:52:59,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:52:59,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:52:59,686 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:52:59,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:52:59,686 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-05 19:52:59,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:53:00,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:53:00,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:53:00,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:53:00,023 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:53:00,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-12-05 19:53:01,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:53:01,464 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:53:01,464 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-12-05 19:53:01,476 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef4fcff/684aaf2b1a8b4858ad6406735e119c78/FLAG02e356c8d [2022-12-05 19:53:01,490 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ef4fcff/684aaf2b1a8b4858ad6406735e119c78 [2022-12-05 19:53:01,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:53:01,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:53:01,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:53:01,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:53:01,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:53:01,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:53:01" (1/1) ... [2022-12-05 19:53:01,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f4f424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:01, skipping insertion in model container [2022-12-05 19:53:01,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:53:01" (1/1) ... [2022-12-05 19:53:01,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:53:01,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:53:01,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-12-05 19:53:01,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:53:01,928 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:53:01,981 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-12-05 19:53:01,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:53:02,046 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:53:02,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02 WrapperNode [2022-12-05 19:53:02,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:53:02,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:53:02,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:53:02,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:53:02,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,110 INFO L138 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-12-05 19:53:02,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:53:02,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:53:02,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:53:02,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:53:02,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:53:02,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:53:02,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:53:02,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:53:02,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (1/1) ... [2022-12-05 19:53:02,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:53:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:02,201 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-05 19:53:02,225 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-05 19:53:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:53:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:53:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-05 19:53:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:53:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:53:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:53:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:53:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:53:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:53:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 19:53:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:53:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:53:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:53:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:53:02,245 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:53:02,355 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:53:02,357 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:53:02,584 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:53:02,592 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:53:02,592 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 19:53:02,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:53:02 BoogieIcfgContainer [2022-12-05 19:53:02,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:53:02,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:53:02,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:53:02,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:53:02,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:53:01" (1/3) ... [2022-12-05 19:53:02,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a986d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:53:02, skipping insertion in model container [2022-12-05 19:53:02,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:53:02" (2/3) ... [2022-12-05 19:53:02,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a986d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:53:02, skipping insertion in model container [2022-12-05 19:53:02,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:53:02" (3/3) ... [2022-12-05 19:53:02,601 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-12-05 19:53:02,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:53:02,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:53:02,618 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:53:02,683 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 19:53:02,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 131 transitions, 278 flow [2022-12-05 19:53:02,766 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-05 19:53:02,767 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:53:02,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 10/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 3 conditions per place. [2022-12-05 19:53:02,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 131 transitions, 278 flow [2022-12-05 19:53:02,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 118 transitions, 248 flow [2022-12-05 19:53:02,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:53:02,796 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2919e9d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:53:02,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 19:53:02,826 INFO L130 PetriNetUnfolder]: 8/117 cut-off events. [2022-12-05 19:53:02,827 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:53:02,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:02,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:02,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1760909140, now seen corresponding path program 1 times [2022-12-05 19:53:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:02,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838190807] [2022-12-05 19:53:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:03,289 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-05 19:53:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:03,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838190807] [2022-12-05 19:53:03,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838190807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:53:03,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:53:03,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:53:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913166515] [2022-12-05 19:53:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:53:03,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:53:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:53:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:53:03,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 131 [2022-12-05 19:53:03,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-05 19:53:03,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:03,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 131 [2022-12-05 19:53:03,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:03,424 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2022-12-05 19:53:03,424 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 19:53:03,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 170 events. 16/170 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 378 event pairs, 5 based on Foata normal form. 21/181 useless extension candidates. Maximal degree in co-relation 155. Up to 22 conditions per place. [2022-12-05 19:53:03,427 INFO L137 encePairwiseOnDemand]: 124/131 looper letters, 12 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2022-12-05 19:53:03,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 279 flow [2022-12-05 19:53:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:53:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:53:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-12-05 19:53:03,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9363867684478372 [2022-12-05 19:53:03,441 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 248 flow. Second operand 3 states and 368 transitions. [2022-12-05 19:53:03,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 279 flow [2022-12-05 19:53:03,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 269 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:53:03,448 INFO L231 Difference]: Finished difference. Result has 116 places, 115 transitions, 244 flow [2022-12-05 19:53:03,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=116, PETRI_TRANSITIONS=115} [2022-12-05 19:53:03,453 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2022-12-05 19:53:03,454 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 115 transitions, 244 flow [2022-12-05 19:53:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-05 19:53:03,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:03,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:03,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:53:03,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2125532005, now seen corresponding path program 1 times [2022-12-05 19:53:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411413602] [2022-12-05 19:53:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:53:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:03,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411413602] [2022-12-05 19:53:03,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411413602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:53:03,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576571465] [2022-12-05 19:53:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:03,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:03,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:03,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:53:03,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:53:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:03,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-05 19:53:03,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:53:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:53:04,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:53:04,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576571465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:53:04,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:53:04,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-05 19:53:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421077876] [2022-12-05 19:53:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:53:04,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:53:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:53:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 19:53:04,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 131 [2022-12-05 19:53:04,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-05 19:53:04,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:04,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 131 [2022-12-05 19:53:04,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:04,132 INFO L130 PetriNetUnfolder]: 20/192 cut-off events. [2022-12-05 19:53:04,132 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-05 19:53:04,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 192 events. 20/192 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 550 event pairs, 7 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 164. Up to 28 conditions per place. [2022-12-05 19:53:04,134 INFO L137 encePairwiseOnDemand]: 128/131 looper letters, 15 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-12-05 19:53:04,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 289 flow [2022-12-05 19:53:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:53:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:53:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-12-05 19:53:04,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9083969465648855 [2022-12-05 19:53:04,142 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 244 flow. Second operand 3 states and 357 transitions. [2022-12-05 19:53:04,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 289 flow [2022-12-05 19:53:04,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:53:04,147 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 254 flow [2022-12-05 19:53:04,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2022-12-05 19:53:04,148 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2022-12-05 19:53:04,148 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 254 flow [2022-12-05 19:53:04,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-05 19:53:04,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:04,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:04,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 19:53:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:04,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 744158185, now seen corresponding path program 1 times [2022-12-05 19:53:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:04,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634162751] [2022-12-05 19:53:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:53:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634162751] [2022-12-05 19:53:04,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634162751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:53:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670424070] [2022-12-05 19:53:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:04,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:04,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:04,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:53:04,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 19:53:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:04,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 19:53:04,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:53:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:53:04,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:53:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:53:04,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670424070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:53:04,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:53:04,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-05 19:53:04,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024831343] [2022-12-05 19:53:04,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:53:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:53:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:53:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-05 19:53:04,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2022-12-05 19:53:04,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 254 flow. Second operand has 9 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 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-05 19:53:04,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:04,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2022-12-05 19:53:04,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:04,952 INFO L130 PetriNetUnfolder]: 26/226 cut-off events. [2022-12-05 19:53:04,952 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:53:04,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 226 events. 26/226 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 548 event pairs, 4 based on Foata normal form. 4/220 useless extension candidates. Maximal degree in co-relation 261. Up to 17 conditions per place. [2022-12-05 19:53:04,955 INFO L137 encePairwiseOnDemand]: 125/131 looper letters, 18 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2022-12-05 19:53:04,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 131 transitions, 347 flow [2022-12-05 19:53:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:53:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:53:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1055 transitions. [2022-12-05 19:53:04,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8948261238337574 [2022-12-05 19:53:04,968 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 254 flow. Second operand 9 states and 1055 transitions. [2022-12-05 19:53:04,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 131 transitions, 347 flow [2022-12-05 19:53:04,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 131 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:53:04,971 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 302 flow [2022-12-05 19:53:04,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2022-12-05 19:53:04,972 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2022-12-05 19:53:04,972 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 302 flow [2022-12-05 19:53:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 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-05 19:53:04,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:04,973 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:04,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 19:53:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-05 19:53:05,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash 490276105, now seen corresponding path program 2 times [2022-12-05 19:53:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:05,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387571116] [2022-12-05 19:53:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-05 19:53:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387571116] [2022-12-05 19:53:05,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387571116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:53:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399959214] [2022-12-05 19:53:05,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:53:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:05,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:53:05,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 19:53:05,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:53:05,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:53:05,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 19:53:05,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:53:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-05 19:53:05,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 19:53:05,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399959214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:53:05,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 19:53:05,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-05 19:53:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237294824] [2022-12-05 19:53:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:53:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 19:53:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 19:53:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:53:05,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 131 [2022-12-05 19:53:05,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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-05 19:53:05,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:05,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 131 [2022-12-05 19:53:05,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:05,779 INFO L130 PetriNetUnfolder]: 307/1226 cut-off events. [2022-12-05 19:53:05,779 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-05 19:53:05,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 1226 events. 307/1226 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7054 event pairs, 41 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 1515. Up to 186 conditions per place. [2022-12-05 19:53:05,794 INFO L137 encePairwiseOnDemand]: 122/131 looper letters, 32 selfloop transitions, 18 changer transitions 0/157 dead transitions. [2022-12-05 19:53:05,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 157 transitions, 478 flow [2022-12-05 19:53:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:53:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:53:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2022-12-05 19:53:05,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8974918211559433 [2022-12-05 19:53:05,803 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 302 flow. Second operand 7 states and 823 transitions. [2022-12-05 19:53:05,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 157 transitions, 478 flow [2022-12-05 19:53:05,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 157 transitions, 472 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 19:53:05,812 INFO L231 Difference]: Finished difference. Result has 139 places, 140 transitions, 436 flow [2022-12-05 19:53:05,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=139, PETRI_TRANSITIONS=140} [2022-12-05 19:53:05,814 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 22 predicate places. [2022-12-05 19:53:05,814 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 140 transitions, 436 flow [2022-12-05 19:53:05,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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-05 19:53:05,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:05,815 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:05,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 19:53:06,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:06,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 12643131, now seen corresponding path program 3 times [2022-12-05 19:53:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:06,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303387475] [2022-12-05 19:53:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-05 19:53:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303387475] [2022-12-05 19:53:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303387475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:53:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092592975] [2022-12-05 19:53:06,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:53:06,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:06,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:53:06,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 19:53:06,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-05 19:53:06,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:53:06,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 19:53:06,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:53:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-05 19:53:06,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:53:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-05 19:53:06,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092592975] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:53:06,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:53:06,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-05 19:53:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573571729] [2022-12-05 19:53:06,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:53:06,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 19:53:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 19:53:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-05 19:53:06,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2022-12-05 19:53:06,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 436 flow. Second operand has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-05 19:53:06,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:06,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2022-12-05 19:53:06,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:06,664 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([358] thread1EXIT-->L915-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][148], [Black: 1466#(and (<= 0 |thread1Thread1of1ForFork0_#t~post6|) (<= 1 ~num~0)), 113#L915-2true, 1897#(< thread2Thread1of1ForFork1_~j~0 3), Black: 386#(<= thread2Thread1of1ForFork1_~j~0 0), Black: 133#(= thread1Thread1of1ForFork0_~i~0 0), 1079#(<= 1 ~num~0), Black: 425#(<= thread1Thread1of1ForFork0_~i~0 1), Black: 836#(< thread1Thread1of1ForFork0_~i~0 3), 15#L897true, 421#true, Black: 1075#true, Black: 1218#(<= 0 ~num~0), Black: 1288#(<= 0 |thread1Thread1of1ForFork0_#t~post6|), Black: 1464#(and (<= 0 |thread1Thread1of1ForFork0_#t~post6|) (<= 0 ~num~0))]) [2022-12-05 19:53:06,664 INFO L382 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-12-05 19:53:06,665 INFO L385 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-12-05 19:53:06,665 INFO L385 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-12-05 19:53:06,665 INFO L385 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-12-05 19:53:06,680 INFO L130 PetriNetUnfolder]: 329/1514 cut-off events. [2022-12-05 19:53:06,680 INFO L131 PetriNetUnfolder]: For 814/903 co-relation queries the response was YES. [2022-12-05 19:53:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 1514 events. 329/1514 cut-off events. For 814/903 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10203 event pairs, 29 based on Foata normal form. 58/1524 useless extension candidates. Maximal degree in co-relation 2810. Up to 171 conditions per place. [2022-12-05 19:53:06,694 INFO L137 encePairwiseOnDemand]: 125/131 looper letters, 22 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2022-12-05 19:53:06,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 157 transitions, 541 flow [2022-12-05 19:53:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 19:53:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 19:53:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1041 transitions. [2022-12-05 19:53:06,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8829516539440203 [2022-12-05 19:53:06,698 INFO L175 Difference]: Start difference. First operand has 139 places, 140 transitions, 436 flow. Second operand 9 states and 1041 transitions. [2022-12-05 19:53:06,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 157 transitions, 541 flow [2022-12-05 19:53:06,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 157 transitions, 541 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 19:53:06,705 INFO L231 Difference]: Finished difference. Result has 150 places, 146 transitions, 486 flow [2022-12-05 19:53:06,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=486, PETRI_PLACES=150, PETRI_TRANSITIONS=146} [2022-12-05 19:53:06,705 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-12-05 19:53:06,706 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 146 transitions, 486 flow [2022-12-05 19:53:06,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-05 19:53:06,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:06,707 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:06,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 19:53:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:06,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1489789817, now seen corresponding path program 4 times [2022-12-05 19:53:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106395011] [2022-12-05 19:53:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-05 19:53:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:07,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106395011] [2022-12-05 19:53:07,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106395011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:53:07,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:53:07,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:53:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239062868] [2022-12-05 19:53:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:53:07,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:53:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:53:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:53:07,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 131 [2022-12-05 19:53:07,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 146 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-05 19:53:07,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:07,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 131 [2022-12-05 19:53:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:07,244 INFO L130 PetriNetUnfolder]: 124/889 cut-off events. [2022-12-05 19:53:07,244 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2022-12-05 19:53:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 889 events. 124/889 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4591 event pairs, 13 based on Foata normal form. 92/981 useless extension candidates. Maximal degree in co-relation 1489. Up to 127 conditions per place. [2022-12-05 19:53:07,250 INFO L137 encePairwiseOnDemand]: 123/131 looper letters, 16 selfloop transitions, 8 changer transitions 0/138 dead transitions. [2022-12-05 19:53:07,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 138 transitions, 482 flow [2022-12-05 19:53:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:53:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:53:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-12-05 19:53:07,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8575063613231552 [2022-12-05 19:53:07,252 INFO L175 Difference]: Start difference. First operand has 150 places, 146 transitions, 486 flow. Second operand 3 states and 337 transitions. [2022-12-05 19:53:07,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 138 transitions, 482 flow [2022-12-05 19:53:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 138 transitions, 462 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-05 19:53:07,258 INFO L231 Difference]: Finished difference. Result has 148 places, 136 transitions, 424 flow [2022-12-05 19:53:07,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=148, PETRI_TRANSITIONS=136} [2022-12-05 19:53:07,259 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2022-12-05 19:53:07,259 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 136 transitions, 424 flow [2022-12-05 19:53:07,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-05 19:53:07,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:07,260 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:07,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 19:53:07,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -523614185, now seen corresponding path program 5 times [2022-12-05 19:53:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:07,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026221140] [2022-12-05 19:53:07,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:53:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-05 19:53:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:53:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026221140] [2022-12-05 19:53:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026221140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:53:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040663277] [2022-12-05 19:53:07,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 19:53:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:53:07,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:53:07,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 19:53:07,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-05 19:53:07,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:53:07,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-05 19:53:07,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:53:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-05 19:53:07,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:53:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-05 19:53:07,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040663277] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:53:07,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:53:07,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 7 [2022-12-05 19:53:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277640336] [2022-12-05 19:53:07,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:53:07,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:53:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:53:07,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:53:07,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:53:07,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 131 [2022-12-05 19:53:07,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 136 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 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-05 19:53:07,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:53:07,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 131 [2022-12-05 19:53:07,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:53:08,016 INFO L130 PetriNetUnfolder]: 43/435 cut-off events. [2022-12-05 19:53:08,017 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-05 19:53:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 435 events. 43/435 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1316 event pairs, 3 based on Foata normal form. 26/459 useless extension candidates. Maximal degree in co-relation 567. Up to 57 conditions per place. [2022-12-05 19:53:08,020 INFO L137 encePairwiseOnDemand]: 120/131 looper letters, 18 selfloop transitions, 11 changer transitions 0/141 dead transitions. [2022-12-05 19:53:08,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 141 transitions, 491 flow [2022-12-05 19:53:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 19:53:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 19:53:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 899 transitions. [2022-12-05 19:53:08,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.857824427480916 [2022-12-05 19:53:08,022 INFO L175 Difference]: Start difference. First operand has 148 places, 136 transitions, 424 flow. Second operand 8 states and 899 transitions. [2022-12-05 19:53:08,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 141 transitions, 491 flow [2022-12-05 19:53:08,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 141 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:53:08,026 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 441 flow [2022-12-05 19:53:08,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=441, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2022-12-05 19:53:08,027 INFO L294 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-12-05 19:53:08,027 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 441 flow [2022-12-05 19:53:08,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 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-05 19:53:08,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:53:08,028 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:53:08,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 19:53:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:53:08,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:53:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:53:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1534044327, now seen corresponding path program 6 times [2022-12-05 19:53:08,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:53:08,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709148943] [2022-12-05 19:53:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:53:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:53:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 19:53:08,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 19:53:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 19:53:08,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 19:53:08,355 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 19:53:08,357 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 19:53:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 19:53:08,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 19:53:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 19:53:08,360 INFO L458 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2022-12-05 19:53:08,365 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 19:53:08,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 19:53:08,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 07:53:08 BasicIcfg [2022-12-05 19:53:08,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 19:53:08,460 INFO L158 Benchmark]: Toolchain (without parser) took 6966.22ms. Allocated memory was 195.0MB in the beginning and 286.3MB in the end (delta: 91.2MB). Free memory was 153.7MB in the beginning and 163.4MB in the end (delta: -9.7MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,460 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 19:53:08,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.80ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 127.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.04ms. Allocated memory is still 195.0MB. Free memory was 127.5MB in the beginning and 124.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,461 INFO L158 Benchmark]: Boogie Preprocessor took 55.85ms. Allocated memory is still 195.0MB. Free memory was 124.9MB in the beginning and 123.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,461 INFO L158 Benchmark]: RCFGBuilder took 426.12ms. Allocated memory is still 195.0MB. Free memory was 123.3MB in the beginning and 106.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,462 INFO L158 Benchmark]: TraceAbstraction took 5863.66ms. Allocated memory was 195.0MB in the beginning and 286.3MB in the end (delta: 91.2MB). Free memory was 105.5MB in the beginning and 163.4MB in the end (delta: -57.9MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-12-05 19:53:08,463 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.14ms. Allocated memory is still 195.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 552.80ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 127.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.04ms. Allocated memory is still 195.0MB. Free memory was 127.5MB in the beginning and 124.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.85ms. Allocated memory is still 195.0MB. Free memory was 124.9MB in the beginning and 123.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 426.12ms. Allocated memory is still 195.0MB. Free memory was 123.3MB in the beginning and 106.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5863.66ms. Allocated memory was 195.0MB in the beginning and 286.3MB in the end (delta: 91.2MB). Free memory was 105.5MB in the beginning and 163.4MB in the end (delta: -57.9MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; VAL [num=0] [L871] 0 unsigned long total; VAL [num=0, total=0] [L872] 0 int flag; VAL [flag=0, num=0, total=0] [L873] 0 pthread_mutex_t m; VAL [flag=0, m={3:0}, num=0, total=0] [L874] 0 pthread_cond_t empty, full; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=9, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=10, t1={7:0}, t2={6:0}, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=1, m={3:0}, num=0, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=2, m={3:0}, num=0, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L915] 0 \read(t1) VAL [\read(t1)=9, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=9, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L916] 0 \read(t2) VAL [\read(t2)=10, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=10, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 167 locations, 3 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: 5.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 41 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1038 GetRequests, 985 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=486occurred in iteration=5, InterpolantAutomatonStates: 42, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1603 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1822 ConstructedInterpolants, 0 QuantifiedInterpolants, 2822 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1642 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 469/493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 19:53:08,478 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...