./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 13:22:38,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 13:22:38,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 13:22:38,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 13:22:38,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 13:22:38,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 13:22:38,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 13:22:38,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 13:22:38,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 13:22:38,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 13:22:38,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 13:22:38,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 13:22:38,824 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 13:22:38,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 13:22:38,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 13:22:38,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 13:22:38,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 13:22:38,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 13:22:38,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 13:22:38,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 13:22:38,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 13:22:38,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 13:22:38,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 13:22:38,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 13:22:38,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 13:22:38,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 13:22:38,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 13:22:38,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 13:22:38,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 13:22:38,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 13:22:38,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 13:22:38,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 13:22:38,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 13:22:38,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 13:22:38,835 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 13:22:38,836 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 13:22:38,836 INFO L153 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e [2024-09-22 13:22:39,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 13:22:39,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 13:22:39,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 13:22:39,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 13:22:39,110 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 13:22:39,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-09-22 13:22:40,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 13:22:40,654 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 13:22:40,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-09-22 13:22:40,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/78b47a748/9dae60c437af4f98842528cc972d1e4e/FLAGb6a4598f6 [2024-09-22 13:22:41,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/78b47a748/9dae60c437af4f98842528cc972d1e4e [2024-09-22 13:22:41,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 13:22:41,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-22 13:22:41,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 13:22:41,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 13:22:41,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 13:22:41,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ebee8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41, skipping insertion in model container [2024-09-22 13:22:41,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 13:22:41,243 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2580,2593] [2024-09-22 13:22:41,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 13:22:41,261 INFO L200 MainTranslator]: Completed pre-run [2024-09-22 13:22:41,289 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c[2580,2593] [2024-09-22 13:22:41,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 13:22:41,310 INFO L204 MainTranslator]: Completed translation [2024-09-22 13:22:41,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41 WrapperNode [2024-09-22 13:22:41,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 13:22:41,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 13:22:41,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 13:22:41,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 13:22:41,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,346 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-09-22 13:22:41,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 13:22:41,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 13:22:41,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 13:22:41,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 13:22:41,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 13:22:41,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 13:22:41,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 13:22:41,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 13:22:41,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (1/1) ... [2024-09-22 13:22:41,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 13:22:41,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 13:22:41,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-22 13:22:41,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-22 13:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 13:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-09-22 13:22:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-09-22 13:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-09-22 13:22:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-09-22 13:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 13:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-22 13:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-22 13:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 13:22:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 13:22:41,470 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 13:22:41,582 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 13:22:41,585 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 13:22:41,816 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 13:22:41,817 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 13:22:42,007 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 13:22:42,008 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-22 13:22:42,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 01:22:42 BoogieIcfgContainer [2024-09-22 13:22:42,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 13:22:42,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 13:22:42,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 13:22:42,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 13:22:42,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 01:22:41" (1/3) ... [2024-09-22 13:22:42,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 01:22:42, skipping insertion in model container [2024-09-22 13:22:42,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 01:22:41" (2/3) ... [2024-09-22 13:22:42,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 01:22:42, skipping insertion in model container [2024-09-22 13:22:42,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 01:22:42" (3/3) ... [2024-09-22 13:22:42,017 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-09-22 13:22:42,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 13:22:42,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-22 13:22:42,031 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 13:22:42,070 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-22 13:22:42,108 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 13:22:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 13:22:42,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 13:22:42,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 13:22:42,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-22 13:22:42,140 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 13:22:42,153 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 13:22:42,158 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@55a8b53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 13:22:42,158 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-22 13:22:42,278 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:22:42,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:22:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1167579706, now seen corresponding path program 1 times [2024-09-22 13:22:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:22:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464210836] [2024-09-22 13:22:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:22:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:22:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:22:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464210836] [2024-09-22 13:22:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464210836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 13:22:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 13:22:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 13:22:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543979943] [2024-09-22 13:22:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 13:22:42,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-22 13:22:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:22:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-22 13:22:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-22 13:22:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:42,904 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:22:42,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-09-22 13:22:42,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:43,048 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 13:22:43,049 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:22:43,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:22:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1867846974, now seen corresponding path program 1 times [2024-09-22 13:22:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:22:43,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617985442] [2024-09-22 13:22:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:22:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:22:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:22:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617985442] [2024-09-22 13:22:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617985442] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 13:22:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 13:22:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-22 13:22:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876487916] [2024-09-22 13:22:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 13:22:43,381 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-22 13:22:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:22:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-22 13:22:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-22 13:22:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:43,385 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:22:43,385 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-09-22 13:22:43,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:43,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:43,493 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-22 13:22:43,493 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:22:43,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:22:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 930523526, now seen corresponding path program 1 times [2024-09-22 13:22:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:22:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578949654] [2024-09-22 13:22:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:22:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-22 13:22:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:22:43,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578949654] [2024-09-22 13:22:43,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578949654] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 13:22:43,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 13:22:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-22 13:22:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482587252] [2024-09-22 13:22:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 13:22:43,787 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-22 13:22:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:22:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-22 13:22:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-22 13:22:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:43,791 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:22:43,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2024-09-22 13:22:43,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:43,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:43,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:43,901 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-22 13:22:43,901 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:22:43,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:22:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1773299046, now seen corresponding path program 1 times [2024-09-22 13:22:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:22:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067722979] [2024-09-22 13:22:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:22:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 13:22:44,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:22:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067722979] [2024-09-22 13:22:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067722979] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 13:22:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510932061] [2024-09-22 13:22:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 13:22:44,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 13:22:44,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 13:22:44,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-22 13:22:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:44,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-22 13:22:44,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 13:22:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 13:22:44,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 13:22:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 13:22:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510932061] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 13:22:44,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 13:22:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-22 13:22:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933293645] [2024-09-22 13:22:44,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 13:22:44,698 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-22 13:22:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:22:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-22 13:22:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-22 13:22:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:44,701 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:22:44,701 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-09-22 13:22:44,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:44,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 13:22:44,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-22 13:22:45,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 13:22:45,058 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:22:45,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:22:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1283021578, now seen corresponding path program 2 times [2024-09-22 13:22:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:22:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542516580] [2024-09-22 13:22:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:22:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:22:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:22:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:22:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:22:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542516580] [2024-09-22 13:22:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542516580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 13:22:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000081601] [2024-09-22 13:22:46,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 13:22:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 13:22:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 13:22:46,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 13:22:46,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-22 13:22:46,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 13:22:46,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 13:22:46,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-22 13:22:46,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 13:22:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:22:47,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 13:22:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:22:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000081601] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 13:22:53,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 13:22:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2024-09-22 13:22:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431630100] [2024-09-22 13:22:53,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 13:22:53,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-22 13:22:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:22:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-22 13:22:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=329, Unknown=3, NotChecked=0, Total=420 [2024-09-22 13:22:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:22:53,649 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:22:53,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 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) [2024-09-22 13:22:53,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:22:53,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:53,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:22:53,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 13:22:53,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:23:08,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:23:22,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_~N~0 2147483648))) (let ((.cse1 (* c_~N~0 2)) (.cse13 (div c_~i1~0 4294967296)) (.cse0 (* .cse12 4294967296))) (let ((.cse11 (+ c_~i1~0 .cse0 1)) (.cse10 (+ .cse1 (* 4294967296 .cse13))) (.cse9 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296)) (.cse3 (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2)) (.cse2 (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2)) (.cse4 (+ (mod (+ c_~i1~0 1) 4294967296) 1))) (and (< (+ .cse0 c_~i2~0 1) (+ .cse1 (* (div c_~i2~0 4294967296) 4294967296))) (< .cse2 (+ (mod (+ c_~i1~0 2) 4294967296) 1)) (< .cse3 .cse4) (let ((.cse5 (* 8589934592 .cse12)) (.cse6 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse7 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse5 c_~i2~0) (+ .cse6 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse7) 4294967296) 4294967296))) (let ((.cse8 (* (div (+ (- 1) .cse1 c_~i2~0 .cse7) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse8) (+ .cse1 .cse9)) (<= (+ 3 .cse5 c_~i2~0) (+ .cse6 .cse1 .cse8)))) (< .cse10 .cse11))) (<= .cse11 .cse10) (<= (+ (* 8589934592 .cse13) (* (div c_~i1~0 2) 2) c_~i2~0 1) (+ .cse9 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2))) (< .cse3 (+ (mod c_~i1~0 4294967296) 1)) (< .cse2 .cse4))))) is different from false [2024-09-22 13:23:25,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:23:27,543 WARN L854 $PredicateComparison]: unable to prove that (and (< (* (div (mod (+ c_~i2~0 1) 4294967296) 2) 2) (+ (mod (+ c_~i1~0 1) 4294967296) 1)) (let ((.cse5 (div c_~N~0 2147483648))) (let ((.cse0 (* 8589934592 .cse5)) (.cse1 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse3 (* c_~i1~0 (- 1))) (.cse2 (* c_~N~0 2))) (or (< (+ 2 .cse0 c_~i2~0) (+ .cse1 .cse2 (* (div (+ .cse2 c_~i2~0 (- 4294967297) .cse3) 4294967296) 4294967296))) (let ((.cse4 (* (div (+ (- 1) .cse2 c_~i2~0 .cse3) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse4) (+ .cse2 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse0 c_~i2~0) (+ .cse1 .cse2 .cse4)))) (< (+ .cse2 (* 4294967296 (div c_~i1~0 4294967296))) (+ c_~i1~0 (* .cse5 4294967296) 1))))) (< (* 2 (div (mod c_~i2~0 4294967296) 2)) (+ (mod c_~i1~0 4294967296) 1))) is different from false [2024-09-22 13:23:32,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~N~0 2147483648))) (let ((.cse2 (* (div c_~i2~0 4294967296) 4294967296)) (.cse1 (* c_~N~0 2)) (.cse3 (div c_~i1~0 4294967296)) (.cse0 (* .cse8 4294967296))) (and (< (+ .cse0 c_~i2~0 1) (+ .cse1 .cse2)) (<= (+ (* 8589934592 .cse3) (* (div c_~i1~0 2) 2) 2 c_~i2~0) (+ (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* c_~i1~0 2) .cse2)) (let ((.cse4 (* 8589934592 .cse8)) (.cse5 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse6 (* c_~i1~0 (- 1)))) (or (< (+ 2 .cse4 c_~i2~0) (+ .cse5 .cse1 (* (div (+ .cse1 c_~i2~0 (- 4294967297) .cse6) 4294967296) 4294967296))) (let ((.cse7 (* (div (+ (- 1) .cse1 c_~i2~0 .cse6) 4294967296) 4294967296))) (and (<= (+ c_~i1~0 .cse7) (+ .cse1 (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296))) (<= (+ 3 .cse4 c_~i2~0) (+ .cse5 .cse1 .cse7)))) (< (+ .cse1 (* 4294967296 .cse3)) (+ c_~i1~0 .cse0 1))))))) is different from false [2024-09-22 13:23:34,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:23:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:23:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:23:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:23:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 13:23:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-22 13:23:43,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-22 13:23:44,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 13:23:44,164 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 13:23:44,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 13:23:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash -688646322, now seen corresponding path program 3 times [2024-09-22 13:23:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 13:23:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102149676] [2024-09-22 13:23:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 13:23:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 13:23:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 13:23:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 36 proven. 175 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-22 13:23:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 13:23:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102149676] [2024-09-22 13:23:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102149676] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 13:23:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541575223] [2024-09-22 13:23:45,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 13:23:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 13:23:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 13:23:45,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 13:23:45,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-22 13:23:45,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-09-22 13:23:45,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 13:23:45,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-22 13:23:45,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 13:23:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 29 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:23:47,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 13:23:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 29 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 13:23:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541575223] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 13:23:58,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 13:23:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-09-22 13:23:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647287154] [2024-09-22 13:23:58,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 13:23:58,382 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-22 13:23:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 13:23:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-22 13:23:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2024-09-22 13:23:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:23:58,385 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 13:23:58,386 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.056603773584905) internal successors, (215), 52 states have internal predecessors, (215), 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) [2024-09-22 13:23:58,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 13:23:58,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:23:58,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-22 13:23:58,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 13:23:58,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-22 13:23:58,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 13:25:03,175 WARN L293 SmtUtils]: Spent 32.24s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:25:05,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:25:07,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:25:09,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:25:11,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:25:13,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:25:15,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:26:20,660 WARN L293 SmtUtils]: Spent 56.75s on a formula simplification. DAG size of input: 75 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:26:22,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:26:24,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:27:13,933 WARN L293 SmtUtils]: Spent 36.27s on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:27:15,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:27:17,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:27:18,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:27:59,485 WARN L293 SmtUtils]: Spent 26.46s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:28:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:01,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:03,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:05,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:07,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:10,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:12,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:14,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:28:47,323 WARN L293 SmtUtils]: Spent 16.88s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:28:50,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:29:17,515 WARN L293 SmtUtils]: Spent 13.04s on a formula simplification. DAG size of input: 71 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:29:19,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:29:21,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:29:24,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:29:46,961 WARN L293 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:29:48,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:29:52,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:06,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:09,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:10,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:12,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:14,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:16,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:18,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:20,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:22,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:24,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:30:26,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:31:30,350 WARN L293 SmtUtils]: Spent 52.81s on a formula simplification. DAG size of input: 75 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:31:34,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:31:36,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:31:38,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:31:40,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:32:02,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:32:05,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:32:06,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:32:08,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:32:42,619 WARN L293 SmtUtils]: Spent 21.90s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:32:44,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:06,515 WARN L293 SmtUtils]: Spent 10.95s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:33:09,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:11,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:38,287 WARN L293 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:33:41,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:43,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:45,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:33:47,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:13,899 WARN L293 SmtUtils]: Spent 19.23s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:34:15,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:30,837 WARN L293 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 62 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:34:32,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:51,792 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:34:53,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:55,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:57,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:34:59,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:35:02,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:35:03,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:35:37,833 WARN L293 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 66 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:35:54,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:35:56,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:36:14,529 WARN L293 SmtUtils]: Spent 9.46s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:36:33,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:36:35,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:37:03,788 WARN L293 SmtUtils]: Spent 13.48s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-22 13:37:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:37:07,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:37:10,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-22 13:37:12,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15