./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/mult-comm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/mult-comm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:10:49,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:10:49,400 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-08 12:10:49,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:10:49,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:10:49,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:10:49,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:10:49,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:10:49,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:10:49,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:10:49,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:10:49,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:10:49,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:10:49,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:10:49,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:10:49,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:10:49,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:10:49,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:10:49,448 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 12:10:49,448 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 12:10:49,449 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 12:10:49,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:10:49,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:10:49,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:10:49,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:10:49,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:10:49,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:10:49,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:10:49,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:10:49,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:10:49,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:10:49,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:10:49,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:10:49,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:10:49,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:10:49,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:10:49,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:10:49,462 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-08 12:10:49,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:10:49,463 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:10:49,463 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:10:49,464 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 [2024-11-08 12:10:49,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:10:49,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:10:49,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:10:49,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:10:49,888 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:10:49,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/weaver/mult-comm.wvr.c Unable to find full path for "g++" [2024-11-08 12:10:52,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:10:52,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:10:52,447 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/sv-benchmarks/c/weaver/mult-comm.wvr.c [2024-11-08 12:10:52,456 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/data/84fb765b1/38a1af729d0d4e66a11ae792f253628c/FLAG3ea339f26 [2024-11-08 12:10:52,472 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/data/84fb765b1/38a1af729d0d4e66a11ae792f253628c [2024-11-08 12:10:52,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:10:52,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:10:52,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:10:52,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:10:52,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:10:52,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349e19eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52, skipping insertion in model container [2024-11-08 12:10:52,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:10:52,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:10:52,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:10:52,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:10:52,852 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:10:52,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52 WrapperNode [2024-11-08 12:10:52,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:10:52,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:10:52,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:10:52,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:10:52,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,892 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-08 12:10:52,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:10:52,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:10:52,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:10:52,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:10:52,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:10:52,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:10:52,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:10:52,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:10:52,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (1/1) ... [2024-11-08 12:10:52,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:10:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:10:52,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:10:52,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:10:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:10:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 12:10:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 12:10:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 12:10:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 12:10:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:10:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:10:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:10:53,017 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:10:53,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:10:53,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:10:53,353 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:10:53,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:10:53,514 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:10:53,514 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:10:53,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:10:53 BoogieIcfgContainer [2024-11-08 12:10:53,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:10:53,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:10:53,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:10:53,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:10:53,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:10:52" (1/3) ... [2024-11-08 12:10:53,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dddd327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:10:53, skipping insertion in model container [2024-11-08 12:10:53,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:10:52" (2/3) ... [2024-11-08 12:10:53,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dddd327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:10:53, skipping insertion in model container [2024-11-08 12:10:53,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:10:53" (3/3) ... [2024-11-08 12:10:53,529 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-11-08 12:10:53,550 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:10:53,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 12:10:53,551 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:10:53,635 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 12:10:53,710 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:10:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:10:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:10:53,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:10:53,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:10:53,758 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:10:53,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:10:53,781 INFO L333 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=None, 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;@be01de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:10:53,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 12:10:54,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:10:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:10:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2146939191, now seen corresponding path program 1 times [2024-11-08 12:10:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:10:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583600364] [2024-11-08 12:10:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:10:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:10:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583600364] [2024-11-08 12:10:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583600364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:10:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:10:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:10:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091984469] [2024-11-08 12:10:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:10:54,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:10:54,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:10:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:10:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:10:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:54,841 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:10:54,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:10:54,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:10:54,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:10:54,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:10:54,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:10:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1734254156, now seen corresponding path program 1 times [2024-11-08 12:10:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:10:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481124842] [2024-11-08 12:10:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:10:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:10:55,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481124842] [2024-11-08 12:10:55,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481124842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:10:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836083338] [2024-11-08 12:10:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:55,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:10:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:10:55,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:10:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:10:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:55,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:10:55,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:10:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:55,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:10:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836083338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:10:56,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:10:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2024-11-08 12:10:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377946735] [2024-11-08 12:10:56,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:10:56,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:10:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:10:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:10:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:10:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:56,287 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:10:56,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-11-08 12:10:56,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:10:56,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:10:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:10:56,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:10:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:10:56,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:10:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:10:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash -853766668, now seen corresponding path program 1 times [2024-11-08 12:10:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:10:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841971383] [2024-11-08 12:10:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:10:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:10:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841971383] [2024-11-08 12:10:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841971383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:10:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163121377] [2024-11-08 12:10:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:10:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:10:57,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:10:57,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:10:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:57,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 12:10:57,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:10:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:57,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:10:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163121377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:10:57,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:10:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-11-08 12:10:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573032821] [2024-11-08 12:10:57,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:10:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:10:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:10:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:10:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:10:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:57,896 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:10:57,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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-11-08 12:10:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:10:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:10:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:10:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:10:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:10:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:10:58,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:10:58,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:10:58,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:10:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:10:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 805438257, now seen corresponding path program 1 times [2024-11-08 12:10:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:10:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198057935] [2024-11-08 12:10:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:10:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:10:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:10:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198057935] [2024-11-08 12:10:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198057935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:10:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920720306] [2024-11-08 12:10:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:10:59,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:10:59,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:10:59,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:10:59,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:10:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:10:59,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 12:10:59,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:11:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:00,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:11:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920720306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:11:03,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:11:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2024-11-08 12:11:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177736106] [2024-11-08 12:11:03,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:11:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 12:11:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:11:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 12:11:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-08 12:11:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:11:03,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:11:03,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 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-11-08 12:11:03,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:11:03,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:11:03,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:03,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:11:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:11:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:11:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:11:05,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:11:05,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:11:05,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:11:05,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:11:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1272818667, now seen corresponding path program 2 times [2024-11-08 12:11:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:11:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770542743] [2024-11-08 12:11:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:11:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:11:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:11:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:11:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770542743] [2024-11-08 12:11:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770542743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:11:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628335307] [2024-11-08 12:11:10,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:11:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:11:10,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:11:10,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:11:10,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:11:10,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:11:10,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:11:10,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 12:11:10,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:11:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:15,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:11:23,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_~x_1~0 3) 4294967296))) (let ((.cse5 (+ .cse0 4294967296)) (.cse3 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse4 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse2 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18))) (.cse1 (+ v_z_18 .cse6))) (or (= .cse0 .cse1) (< .cse2 .cse3) (< .cse4 .cse2) (< 4294967295 v_z_18) (< v_z_18 0) (= .cse5 .cse1)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse8 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18))) (.cse7 (+ v_z_18 .cse6))) (or (< .cse7 4294967296) (< .cse8 .cse3) (< .cse4 .cse8) (< 4294967295 v_z_18) (= .cse5 .cse7)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse9 (+ v_z_18 .cse6)) (.cse10 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)))) (or (= .cse0 .cse9) (< .cse10 .cse3) (< 4294967295 .cse9) (< .cse4 .cse10) (< v_z_18 0))))))) is different from false [2024-11-08 12:11:25,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 3) 4294967296))) (let ((.cse1 (+ .cse3 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse0 (+ v_z_18 .cse2))) (or (< .cse0 4294967296) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< 4294967295 v_z_18) (= .cse1 .cse0)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse4 (+ v_z_18 .cse2))) (or (= .cse3 .cse4) (< 4294967295 .cse4) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< v_z_18 0)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse5 (+ v_z_18 .cse2))) (or (= .cse3 .cse5) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< 4294967295 v_z_18) (< v_z_18 0) (= .cse1 .cse5))))))) is different from false [2024-11-08 12:11:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 12:11:25,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628335307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:11:25,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:11:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2024-11-08 12:11:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643150642] [2024-11-08 12:11:25,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:11:25,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 12:11:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:11:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 12:11:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=849, Unknown=4, NotChecked=122, Total=1122 [2024-11-08 12:11:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:11:25,941 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:11:25,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 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-11-08 12:11:25,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:11:25,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:11:25,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:25,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:11:25,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:11:28,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_~x_1~0 3) 4294967296))) (let ((.cse1 (+ .cse3 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse0 (+ v_z_18 .cse2))) (or (< .cse0 4294967296) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< 4294967295 v_z_18) (= .cse1 .cse0)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse4 (+ v_z_18 .cse2))) (or (= .cse3 .cse4) (< 4294967295 .cse4) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< v_z_18 0)))) (= c_~x_2~0 0) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse5 (+ v_z_18 .cse2))) (or (= .cse3 .cse5) (not (= (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)) 1)) (< 4294967295 v_z_18) (< v_z_18 0) (= .cse1 .cse5)))) (= c_~x_1~0 0)))) is different from false [2024-11-08 12:11:30,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_~x_1~0 3) 4294967296))) (let ((.cse5 (+ .cse0 4294967296)) (.cse3 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse4 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse2 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18))) (.cse1 (+ v_z_18 .cse6))) (or (= .cse0 .cse1) (< .cse2 .cse3) (< .cse4 .cse2) (< 4294967295 v_z_18) (< v_z_18 0) (= .cse5 .cse1)))) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse8 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18))) (.cse7 (+ v_z_18 .cse6))) (or (< .cse7 4294967296) (< .cse8 .cse3) (< .cse4 .cse8) (< 4294967295 v_z_18) (= .cse5 .cse7)))) (= c_~x_1~0 0) (forall ((v_z_18 Int) (v_y_18 Int)) (let ((.cse9 (+ v_z_18 .cse6)) (.cse10 (+ (* v_y_18 4294967296) (* 2863311531 v_z_18)))) (or (= .cse0 .cse9) (< .cse10 .cse3) (< 4294967295 .cse9) (< .cse4 .cse10) (< v_z_18 0))))))) is different from false [2024-11-08 12:11:39,961 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 51 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:11:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:11:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:11:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:11:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:11:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 12:11:46,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:11:46,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:11:46,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:11:46,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:11:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash -11618721, now seen corresponding path program 3 times [2024-11-08 12:11:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:11:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098392223] [2024-11-08 12:11:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:11:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:11:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:11:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:11:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098392223] [2024-11-08 12:11:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098392223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:11:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805478223] [2024-11-08 12:11:53,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:11:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:11:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:11:53,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:11:53,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:11:53,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-08 12:11:53,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:11:53,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 12:11:53,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:11:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:11:56,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:01,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ 7 c_~x_1~0) 4294967296))) (let ((.cse4 (+ .cse5 4294967296)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse2 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse1 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse3 (+ v_z_24 .cse6))) (or (< .cse0 .cse1) (< .cse1 .cse2) (= .cse3 .cse4) (< v_z_24 0) (< 4294967295 v_z_24) (= .cse5 .cse3)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse7 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse8 (+ v_z_24 .cse6))) (or (< .cse0 .cse7) (< .cse7 .cse2) (= .cse8 .cse4) (< 4294967295 v_z_24) (< .cse8 4294967296)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse9 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse10 (+ v_z_24 .cse6))) (or (< .cse0 .cse9) (< .cse9 .cse2) (< v_z_24 0) (< 4294967295 .cse10) (= .cse5 .cse10))))))) is different from false [2024-11-08 12:12:03,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 7 c_~x_1~0) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse0 (+ v_z_24 .cse2))) (or (< v_z_24 0) (< 4294967295 .cse0) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1)) (= .cse1 .cse0)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse3 (+ v_z_24 .cse2))) (or (= .cse3 .cse4) (< v_z_24 0) (< 4294967295 v_z_24) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1)) (= .cse1 .cse3)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse5 (+ v_z_24 .cse2))) (or (= .cse5 .cse4) (< 4294967295 v_z_24) (< .cse5 4294967296) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1)))))))) is different from false [2024-11-08 12:12:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 12:12:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805478223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:04,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2024-11-08 12:12:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048723518] [2024-11-08 12:12:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:04,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 12:12:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 12:12:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1376, Unknown=2, NotChecked=154, Total=1722 [2024-11-08 12:12:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:04,330 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 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-11-08 12:12:04,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:04,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:12:04,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:12:04,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:12:04,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-11-08 12:12:04,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:06,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 7 c_~x_1~0) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse0 (+ v_z_24 .cse2))) (or (< v_z_24 0) (< 4294967295 .cse0) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1)) (= .cse1 .cse0)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse3 (+ v_z_24 .cse2))) (or (= .cse3 .cse4) (< v_z_24 0) (< 4294967295 v_z_24) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1)) (= .cse1 .cse3)))) (= c_~x_2~0 0) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse5 (+ v_z_24 .cse2))) (or (= .cse5 .cse4) (< 4294967295 v_z_24) (< .cse5 4294967296) (not (= (+ (* v_y_24 4294967296) (* 3067833783 v_z_24)) 1))))) (= c_~x_1~0 0)))) is different from false [2024-11-08 12:12:08,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ 7 c_~x_1~0) 4294967296))) (let ((.cse4 (+ .cse5 4294967296)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse2 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse1 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse3 (+ v_z_24 .cse6))) (or (< .cse0 .cse1) (< .cse1 .cse2) (= .cse3 .cse4) (< v_z_24 0) (< 4294967295 v_z_24) (= .cse5 .cse3)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse7 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse8 (+ v_z_24 .cse6))) (or (< .cse0 .cse7) (< .cse7 .cse2) (= .cse8 .cse4) (< 4294967295 v_z_24) (< .cse8 4294967296)))) (forall ((v_y_24 Int) (v_z_24 Int)) (let ((.cse9 (+ (* v_y_24 4294967296) (* 3067833783 v_z_24))) (.cse10 (+ v_z_24 .cse6))) (or (< .cse0 .cse9) (< .cse9 .cse2) (< v_z_24 0) (< 4294967295 .cse10) (= .cse5 .cse10)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0)))) is different from false [2024-11-08 12:12:26,307 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 98 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:12:31,649 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-11-08 12:12:33,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-11-08 12:12:36,343 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-11-08 12:12:38,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:12:40,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:10,318 WARN L286 SmtUtils]: Spent 17.66s on a formula simplification. DAG size of input: 60 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:13:12,322 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-11-08 12:13:14,533 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-11-08 12:13:16,541 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-11-08 12:13:18,545 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-11-08 12:13:20,547 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-11-08 12:13:22,819 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-11-08 12:13:39,888 WARN L286 SmtUtils]: Spent 14.09s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:13:41,894 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-11-08 12:13:43,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-11-08 12:13:45,972 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-11-08 12:13:57,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:14:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:14:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:14:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:14:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 12:14:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-08 12:14:17,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 12:14:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:14:17,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:14:17,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:14:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1848487751, now seen corresponding path program 4 times [2024-11-08 12:14:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:14:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615704734] [2024-11-08 12:14:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:14:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:14:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:14:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:14:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:14:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615704734] [2024-11-08 12:14:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615704734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:14:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99184407] [2024-11-08 12:14:24,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 12:14:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:14:24,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:14:24,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:14:24,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dbd39fb-1cda-4e4e-82bb-896a371347af/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 12:14:24,790 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 12:14:24,790 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:14:24,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-08 12:14:24,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:14:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:14:32,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:15:16,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 15) 4294967296))) (let ((.cse0 (+ 4294967296 .cse2)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse1 (+ v_z_30 .cse6)) (.cse4 (+ (* v_z_30 4008636143) (* v_y_30 4294967296)))) (or (= .cse0 .cse1) (< 4294967295 v_z_30) (< v_z_30 0) (= .cse1 .cse2) (< .cse3 .cse4) (< .cse4 .cse5)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse8 (+ (* v_z_30 4008636143) (* v_y_30 4294967296))) (.cse7 (+ v_z_30 .cse6))) (or (= .cse0 .cse7) (< 4294967295 v_z_30) (< .cse3 .cse8) (< .cse8 .cse5) (< .cse7 4294967296)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse9 (+ v_z_30 .cse6)) (.cse10 (+ (* v_z_30 4008636143) (* v_y_30 4294967296)))) (or (< 4294967295 .cse9) (< v_z_30 0) (= .cse9 .cse2) (< .cse3 .cse10) (< .cse10 .cse5))))))) is different from false [2024-11-08 12:15:18,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 15) 4294967296))) (let ((.cse3 (+ 4294967296 .cse1)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse0 (+ v_z_30 .cse2))) (or (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< 4294967295 .cse0) (< v_z_30 0) (= .cse0 .cse1)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse4 (+ v_z_30 .cse2))) (or (= .cse3 .cse4) (< 4294967295 v_z_30) (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< v_z_30 0) (= .cse4 .cse1)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse5 (+ v_z_30 .cse2))) (or (= .cse3 .cse5) (< 4294967295 v_z_30) (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< .cse5 4294967296))))))) is different from false [2024-11-08 12:15:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 12:15:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99184407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:15:18,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:15:18,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 69 [2024-11-08 12:15:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618470235] [2024-11-08 12:15:18,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:15:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-08 12:15:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:15:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-08 12:15:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=4059, Unknown=7, NotChecked=266, Total=4830 [2024-11-08 12:15:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:15:18,497 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:15:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 69 states have internal predecessors, (130), 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-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-08 12:15:18,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:15:20,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 15) 4294967296))) (let ((.cse3 (+ 4294967296 .cse1)) (.cse2 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse0 (+ v_z_30 .cse2))) (or (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< 4294967295 .cse0) (< v_z_30 0) (= .cse0 .cse1)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse4 (+ v_z_30 .cse2))) (or (= .cse3 .cse4) (< 4294967295 v_z_30) (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< v_z_30 0) (= .cse4 .cse1)))) (= c_~x_1~0 0) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse5 (+ v_z_30 .cse2))) (or (= .cse3 .cse5) (< 4294967295 v_z_30) (not (= (+ (* v_z_30 4008636143) (* v_y_30 4294967296)) 1)) (< .cse5 4294967296))))))) is different from false [2024-11-08 12:15:22,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_~x_1~0 15) 4294967296))) (let ((.cse0 (+ 4294967296 .cse2)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse1 (+ v_z_30 .cse6)) (.cse4 (+ (* v_z_30 4008636143) (* v_y_30 4294967296)))) (or (= .cse0 .cse1) (< 4294967295 v_z_30) (< v_z_30 0) (= .cse1 .cse2) (< .cse3 .cse4) (< .cse4 .cse5)))) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse8 (+ (* v_z_30 4008636143) (* v_y_30 4294967296))) (.cse7 (+ v_z_30 .cse6))) (or (= .cse0 .cse7) (< 4294967295 v_z_30) (< .cse3 .cse8) (< .cse8 .cse5) (< .cse7 4294967296)))) (= c_~x_2~0 0) (forall ((v_z_30 Int) (v_y_30 Int)) (let ((.cse9 (+ v_z_30 .cse6)) (.cse10 (+ (* v_z_30 4008636143) (* v_y_30 4294967296)))) (or (< 4294967295 .cse9) (< v_z_30 0) (= .cse9 .cse2) (< .cse3 .cse10) (< .cse10 .cse5)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0)))) is different from false [2024-11-08 12:15:27,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse26 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse17 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse28 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse22 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse9 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse16 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse2 (mod c_~a~0 4294967296)) (.cse27 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse25 (mod (+ c_~x_2~0 (* c_~b~0 15)) 4294967296))) (let ((.cse5 (= .cse3 .cse25)) (.cse10 (< .cse2 (+ .cse27 1))) (.cse0 (< .cse2 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 1))) (.cse6 (< .cse2 (+ .cse29 1))) (.cse7 (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296)) (.cse8 (< .cse2 (+ .cse11 1))) (.cse4 (< .cse2 (+ .cse16 1))) (.cse21 (< .cse2 (+ .cse9 1))) (.cse15 (< .cse2 (+ .cse22 1))) (.cse18 (< .cse2 (+ .cse28 1))) (.cse12 (< .cse2 (+ .cse17 1))) (.cse19 (< .cse2 (+ .cse23 1))) (.cse24 (< .cse2 (+ .cse1 1))) (.cse13 (< .cse2 (+ .cse26 1))) (.cse20 (< .cse2 (+ .cse14 1)))) (and (or .cse0 (< .cse1 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) .cse4) (or (not (= .cse2 15)) .cse5) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse2) .cse6 (< .cse2 (+ .cse7 1)) .cse5) (or .cse8 (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) .cse3) (< .cse9 .cse2) .cse10) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) .cse3) (< .cse11 .cse2) .cse10 .cse12) (or .cse13 (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) .cse3) (< .cse14 .cse2) .cse15) (or .cse0 (< .cse16 .cse2) (< .cse2 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (= .cse3 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296))) (or (< .cse17 .cse2) .cse18 .cse19 (= .cse3 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296))) (or (= .cse3 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) .cse6 (< .cse7 .cse2) .cse20) (or .cse21 (< .cse22 .cse2) .cse8 (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) .cse3)) (or (= .cse3 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (< .cse23 .cse2) .cse24 .cse4) (or (= .cse25 (mod (+ c_~x_1~0 15) 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296) (mod c_~b~0 4294967296))) (= .cse3 (mod c_~x_2~0 4294967296)) (or .cse21 (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) .cse3) (< .cse26 .cse2) .cse15) (or .cse18 (= .cse3 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse27 .cse2) .cse12) (or (< .cse28 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) .cse19 .cse24) (or .cse13 (< .cse29 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) .cse20)))) is different from false [2024-11-08 12:16:04,918 WARN L286 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 188 DAG size of output: 156 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:16:07,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:20:06,135 WARN L286 SmtUtils]: Spent 3.74m on a formula simplification that was a NOOP. DAG size: 175 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:20:08,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse26 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse24 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse18 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse28 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse23 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse11 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse27 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse2 (mod c_~a~0 4294967296)) (.cse6 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (let ((.cse0 (< .cse2 (+ .cse6 1))) (.cse7 (= .cse3 (mod (+ c_~x_2~0 (* c_~b~0 15)) 4294967296))) (.cse12 (< .cse2 (+ .cse27 1))) (.cse8 (< .cse2 (+ .cse29 1))) (.cse9 (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296)) (.cse10 (< .cse2 (+ .cse13 1))) (.cse5 (< .cse2 (+ .cse1 1))) (.cse22 (< .cse2 (+ .cse11 1))) (.cse17 (< .cse2 (+ .cse23 1))) (.cse19 (< .cse2 (+ .cse28 1))) (.cse14 (< .cse2 (+ .cse18 1))) (.cse20 (< .cse2 (+ .cse24 1))) (.cse25 (< .cse2 (+ .cse4 1))) (.cse15 (< .cse2 (+ .cse26 1))) (.cse21 (< .cse2 (+ .cse16 1)))) (and (or .cse0 (< .cse1 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296))) (or .cse0 (< .cse4 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) .cse5) (or (< .cse6 .cse2) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) .cse3)) (or (not (= .cse2 15)) .cse7) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse2) .cse8 (< .cse2 (+ .cse9 1)) .cse7) (or .cse10 (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) .cse3) (< .cse11 .cse2) .cse12) (= (mod (* 4294967295 (div (* (- 1) c_~x_2~0) 15)) 4294967296) 1) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) .cse3) (< .cse13 .cse2) .cse12 .cse14) (or .cse15 (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) .cse3) (< .cse16 .cse2) .cse17) (or (< .cse18 .cse2) .cse19 .cse20 (= .cse3 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296))) (or (= .cse3 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) .cse8 (< .cse9 .cse2) .cse21) (or .cse22 (< .cse23 .cse2) .cse10 (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) .cse3)) (or (= .cse3 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (< .cse24 .cse2) .cse25 .cse5) (= (mod (* c_~x_2~0 14) 15) 0) (= .cse3 15) (or .cse22 (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) .cse3) (< .cse26 .cse2) .cse17) (or .cse19 (= .cse3 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse27 .cse2) .cse14) (or (< .cse28 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) .cse20 .cse25) (or .cse15 (< .cse29 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) .cse21)))) is different from false [2024-11-08 12:20:10,956 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-11-08 12:20:12,960 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-11-08 12:20:14,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:20:16,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse24 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse22 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse15 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse26 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse21 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse8 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse10 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse25 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse2 (mod c_~a~0 4294967296)) (.cse6 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (let ((.cse0 (< .cse2 (+ .cse6 1))) (.cse9 (< .cse2 (+ .cse25 1))) (.cse7 (< .cse2 (+ .cse10 1))) (.cse5 (< .cse2 (+ .cse1 1))) (.cse20 (< .cse2 (+ .cse8 1))) (.cse14 (< .cse2 (+ .cse21 1))) (.cse16 (< .cse2 (+ .cse26 1))) (.cse11 (< .cse2 (+ .cse15 1))) (.cse17 (< .cse2 (+ .cse22 1))) (.cse23 (< .cse2 (+ .cse4 1))) (.cse12 (< .cse2 (+ .cse24 1))) (.cse18 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse19 (< .cse2 (+ .cse13 1)))) (and (or .cse0 (< .cse1 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296))) (or .cse0 (< .cse4 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) .cse5) (or (not (= .cse2 15)) (= .cse3 (mod (+ c_~x_2~0 (* c_~b~0 15)) 4294967296))) (or (< .cse6 .cse2) (< .cse2 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (= (mod (+ c_~x_2~0 c_~b~0) 4294967296) .cse3)) (or .cse7 (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) .cse3) (< .cse8 .cse2) .cse9) (or (= (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296) .cse3) (< .cse10 .cse2) .cse9 .cse11) (or .cse12 (= (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296) .cse3) (< .cse13 .cse2) .cse14) (or (< .cse15 .cse2) .cse16 .cse17 (= .cse3 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296))) (or (= .cse3 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (< .cse2 (+ .cse18 1)) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse2) .cse19) (or .cse20 (< .cse21 .cse2) .cse7 (= (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296) .cse3)) (or (= .cse3 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (< .cse22 .cse2) .cse23 .cse5) (= .cse3 (mod c_~x_2~0 4294967296)) (or .cse20 (= (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296) .cse3) (< .cse24 .cse2) .cse14) (or .cse16 (= .cse3 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (< .cse25 .cse2) .cse11) (or (< .cse26 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) .cse17 .cse23) (or .cse12 (< .cse18 .cse2) (= .cse3 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) .cse19)))) is different from false [2024-11-08 12:20:18,236 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-11-08 12:20:20,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:20:22,173 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-11-08 12:20:24,349 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 []