./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:20:54,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:20:54,748 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:20:54,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:20:54,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:20:54,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:20:54,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:20:54,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:20:54,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:20:54,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:20:54,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:20:54,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:20:54,783 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:20:54,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:20:54,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:20:54,785 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:20:54,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:20:54,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:20:54,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:20:54,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:20:54,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:20:54,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:20:54,789 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:20:54,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:20:54,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:20:54,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:20:54,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:20:54,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:20:54,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:20:54,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:20:54,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:20:54,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:20:54,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:20:54,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:20:54,794 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:20:54,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:20:54,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:20:54,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:20:54,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:20:54,795 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:20:54,796 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:20:54,796 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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2023-12-02 20:20:55,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:20:55,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:20:55,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:20:55,075 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:20:55,076 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:20:55,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-12-02 20:20:57,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:20:58,277 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:20:58,278 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-12-02 20:20:58,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/29a0aa0c4/6528f586c43443a6988c12ec694cbf32/FLAGa65c5b527 [2023-12-02 20:20:58,310 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/29a0aa0c4/6528f586c43443a6988c12ec694cbf32 [2023-12-02 20:20:58,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:20:58,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:20:58,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:20:58,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:20:58,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:20:58,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767dcc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58, skipping insertion in model container [2023-12-02 20:20:58,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:20:58,669 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2023-12-02 20:20:58,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:20:58,687 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:20:58,731 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2023-12-02 20:20:58,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:20:58,763 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:20:58,763 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:20:58,769 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:20:58,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58 WrapperNode [2023-12-02 20:20:58,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:20:58,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:20:58,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:20:58,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:20:58,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,817 INFO L138 Inliner]: procedures = 172, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-12-02 20:20:58,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:20:58,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:20:58,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:20:58,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:20:58,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:20:58,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:20:58,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:20:58,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:20:58,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (1/1) ... [2023-12-02 20:20:58,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:20:58,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:20:58,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:20:58,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:20:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:20:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-02 20:20:58,929 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-02 20:20:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:20:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 20:20:58,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:20:58,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:20:58,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:20:58,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:20:58,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 20:20:58,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:20:58,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:20:58,932 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:20:59,072 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:20:59,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:20:59,287 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:20:59,434 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:20:59,435 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 20:20:59,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:59 BoogieIcfgContainer [2023-12-02 20:20:59,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:20:59,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:20:59,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:20:59,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:20:59,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:20:58" (1/3) ... [2023-12-02 20:20:59,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7367eaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:59, skipping insertion in model container [2023-12-02 20:20:59,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:58" (2/3) ... [2023-12-02 20:20:59,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7367eaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:59, skipping insertion in model container [2023-12-02 20:20:59,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:59" (3/3) ... [2023-12-02 20:20:59,445 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-12-02 20:20:59,453 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:20:59,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:20:59,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:20:59,463 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:20:59,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:20:59,564 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:20:59,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:20:59,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:20:59,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:20:59,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:20:59,632 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:20:59,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-12-02 20:20:59,652 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2eccbf16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:20:59,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:20:59,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:20:59,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:20:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 609042331, now seen corresponding path program 1 times [2023-12-02 20:20:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:20:59,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837736894] [2023-12-02 20:20:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:20:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837736894] [2023-12-02 20:21:00,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837736894] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:00,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357965094] [2023-12-02 20:21:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:00,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:00,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:21:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:00,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 20:21:00,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:21:01,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:01,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:01,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:01,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:01,387 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2023-12-02 20:21:01,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2023-12-02 20:21:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:01,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:01,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_52 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_52))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-12-02 20:21:01,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:01,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:01,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:01,975 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-12-02 20:21:01,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1015 treesize of output 996 [2023-12-02 20:21:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 341 [2023-12-02 20:21:02,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:21:02,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:02,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 642 treesize of output 624 [2023-12-02 20:21:02,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 277 [2023-12-02 20:21:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-02 20:21:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:21:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357965094] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:02,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-12-02 20:21:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967148972] [2023-12-02 20:21:02,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:02,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 20:21:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 20:21:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=353, Unknown=3, NotChecked=38, Total=462 [2023-12-02 20:21:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:02,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:02,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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) [2023-12-02 20:21:02,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:03,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:21:04,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 20:21:04,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:04,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -347544293, now seen corresponding path program 2 times [2023-12-02 20:21:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326416494] [2023-12-02 20:21:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326416494] [2023-12-02 20:21:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326416494] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334731437] [2023-12-02 20:21:04,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:21:04,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:04,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:04,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:21:04,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:21:04,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:21:04,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 20:21:04,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:04,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:21:04,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:04,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:04,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:04,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:05,071 INFO L349 Elim1Store]: treesize reduction 102, result has 32.5 percent of original size [2023-12-02 20:21:05,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 95 [2023-12-02 20:21:05,193 INFO L349 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2023-12-02 20:21:05,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2023-12-02 20:21:05,254 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:21:05,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:05,269 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:21:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:07,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:07,235 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_108 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-12-02 20:21:07,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:07,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:07,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:07,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:07,408 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-12-02 20:21:07,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1347 treesize of output 1296 [2023-12-02 20:21:07,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 341 [2023-12-02 20:21:07,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:21:07,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:07,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 642 treesize of output 624 [2023-12-02 20:21:07,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 277 [2023-12-02 20:21:07,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-02 20:21:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:21:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334731437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:07,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-02 20:21:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359540534] [2023-12-02 20:21:07,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:07,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:21:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:21:07,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=398, Unknown=1, NotChecked=40, Total=506 [2023-12-02 20:21:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:07,857 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:07,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 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) [2023-12-02 20:21:07,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:07,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:21:09,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:21:09,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:09,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:09,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1326166078, now seen corresponding path program 1 times [2023-12-02 20:21:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990759520] [2023-12-02 20:21:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990759520] [2023-12-02 20:21:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990759520] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568938320] [2023-12-02 20:21:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:10,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:10,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:21:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:10,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 20:21:10,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:10,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:21:10,621 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 20:21:10,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 20:21:10,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:10,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:10,861 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2023-12-02 20:21:10,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 111 [2023-12-02 20:21:10,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:21:10,909 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:21:10,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2023-12-02 20:21:11,305 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-02 20:21:11,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 28 [2023-12-02 20:21:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:11,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:11,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (forall ((v_DerPreprocessor_13 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_13) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-12-02 20:21:11,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#top~0.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (or (not (= (select v_DerPreprocessor_14 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_14))) (let ((.cse0 (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store |c_#memory_int| |~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse1 |~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)))) |~#top~0.base|) |c_~#top~0.offset|) 0)))) is different from false [2023-12-02 20:21:11,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (|~#top~0.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (or (not (= (select v_DerPreprocessor_14 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_180))) (let ((.cse2 (store .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_14))) (let ((.cse1 (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store .cse0 |~#top~0.base| .cse1) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse2 |~#top~0.base| .cse1) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) |~#top~0.base|) |c_~#top~0.offset|) 0)))) is different from false [2023-12-02 20:21:11,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:11,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:11,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:11,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:11,798 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-12-02 20:21:11,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1622 treesize of output 1596 [2023-12-02 20:21:11,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 322 [2023-12-02 20:21:11,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:11,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1029 treesize of output 1031 [2023-12-02 20:21:11,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 489 [2023-12-02 20:21:12,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:21:12,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2023-12-02 20:21:12,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:12,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 200 [2023-12-02 20:21:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 20:21:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568938320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:12,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-12-02 20:21:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135122325] [2023-12-02 20:21:12,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:12,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 20:21:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 20:21:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=612, Unknown=15, NotChecked=162, Total=930 [2023-12-02 20:21:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:12,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1) internal successors, (63), 30 states have internal predecessors, (63), 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) [2023-12-02 20:21:12,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:12,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:21:12,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:21:15,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:21:15,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:15,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:15,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -522588581, now seen corresponding path program 3 times [2023-12-02 20:21:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332011075] [2023-12-02 20:21:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332011075] [2023-12-02 20:21:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332011075] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330689703] [2023-12-02 20:21:15,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:21:15,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:15,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:15,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:21:15,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:21:15,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:21:15,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 20:21:15,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:15,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:15,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:15,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:16,098 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 20:21:16,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:21:16,128 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-02 20:21:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2023-12-02 20:21:16,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:16,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 20:21:16,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 20:21:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:16,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:18,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (or (not .cse0) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))))) is different from false [2023-12-02 20:21:18,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (or (not .cse0) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))))) is different from false [2023-12-02 20:21:18,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))) is different from false [2023-12-02 20:21:18,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:18,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:18,694 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 20:21:18,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 143 [2023-12-02 20:21:18,719 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 20:21:18,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 160 [2023-12-02 20:21:18,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 136 [2023-12-02 20:21:18,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 132 [2023-12-02 20:21:18,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:21:18,960 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 20:21:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 53 [2023-12-02 20:21:18,970 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:21:18,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 147 [2023-12-02 20:21:18,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-12-02 20:21:18,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:18,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2023-12-02 20:21:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330689703] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:19,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-12-02 20:21:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925133349] [2023-12-02 20:21:19,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:19,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 20:21:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 20:21:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=545, Unknown=6, NotChecked=150, Total=812 [2023-12-02 20:21:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:19,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:19,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 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) [2023-12-02 20:21:19,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:19,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:19,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:21:19,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:19,476 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (not (= (select .cse5 |c_~#top~0.offset|) 0))) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| |c_~#top~0.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |c_~#top~0.base|))) (.cse3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (= |c_~#top~0.offset| 0) (or (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (not .cse0)) .cse1 (or .cse0 (and .cse1 .cse2)) .cse2 (or .cse0 (and (not (= .cse3 0)) .cse2)) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| .cse3)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (not (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse4 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))))) is different from false [2023-12-02 20:21:20,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| |c_~#top~0.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |c_~#top~0.base|))) (.cse1 (select |c_#memory_int| |c_~#top~0.base|)) (.cse3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (not (= (select (select |c_#memory_int| 3) 0) 0)) (= |c_~#top~0.offset| 0) (or (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (not .cse0)) (or .cse0 (and (not (= (select .cse1 |c_~#top~0.offset|) 0)) .cse2)) .cse2 (or .cse0 (and (not (= .cse3 0)) .cse2)) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_242 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| .cse3)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_242))) (or (not (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse4 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))) (= 3 |c_~#top~0.base|))) is different from false [2023-12-02 20:21:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:21,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 20:21:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:21,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:21,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1311644292, now seen corresponding path program 1 times [2023-12-02 20:21:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:21,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635965101] [2023-12-02 20:21:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:21,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:22,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635965101] [2023-12-02 20:21:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635965101] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426060438] [2023-12-02 20:21:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:22,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:22,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:22,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:22,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:21:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:22,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 20:21:22,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:22,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:21:22,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:21:22,820 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:21:22,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2023-12-02 20:21:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:22,867 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-12-02 20:21:22,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 23 [2023-12-02 20:21:22,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:22,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:21:23,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:21:23,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-12-02 20:21:23,126 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:23,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:23,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:23,373 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2023-12-02 20:21:23,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2023-12-02 20:21:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:23,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:23,705 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_337))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-12-02 20:21:23,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:23,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:23,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:23,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:23,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:23,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9762 treesize of output 9676 [2023-12-02 20:21:24,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1569 treesize of output 1553 [2023-12-02 20:21:24,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1473 treesize of output 1409 [2023-12-02 20:21:24,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1369 treesize of output 1305 [2023-12-02 20:21:24,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-02 20:21:24,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:24,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:24,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:24,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:25,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2023-12-02 20:21:25,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:21:25,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:21:25,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2023-12-02 20:21:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:21:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426060438] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:25,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-12-02 20:21:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805111366] [2023-12-02 20:21:25,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:25,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 20:21:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 20:21:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=969, Unknown=3, NotChecked=64, Total=1190 [2023-12-02 20:21:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:25,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:25,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 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) [2023-12-02 20:21:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:27,157 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (forall ((|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) (forall ((v_ArrVal_337 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_337))) (store .cse2 |~#top~0.base| (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)))) is different from false [2023-12-02 20:21:28,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_333 Int) (v_ArrVal_332 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_31| Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_332) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_31|) 0))))) (and (or (< c_~next_alloc_idx~0 65) .cse0) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (forall ((v_ArrVal_333 Int) (v_ArrVal_332 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_332) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (forall ((|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) (forall ((v_ArrVal_337 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_337))) (store .cse3 |~#top~0.base| (store (select .cse3 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) (or .cse0 (not (= c_~next_alloc_idx~0 0))))) is different from false [2023-12-02 20:21:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:30,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:21:30,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:30,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:30,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 355057668, now seen corresponding path program 2 times [2023-12-02 20:21:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226015500] [2023-12-02 20:21:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226015500] [2023-12-02 20:21:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226015500] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639380498] [2023-12-02 20:21:30,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:21:30,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:30,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:30,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:21:31,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:21:31,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:21:31,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 20:21:31,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:21:31,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:31,122 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2023-12-02 20:21:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 23 [2023-12-02 20:21:31,135 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:21:31,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:21:31,154 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:21:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 19 [2023-12-02 20:21:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:31,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:21:31,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:21:31,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-12-02 20:21:31,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:31,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:31,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:31,653 INFO L349 Elim1Store]: treesize reduction 86, result has 43.0 percent of original size [2023-12-02 20:21:31,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 111 [2023-12-02 20:21:31,730 INFO L349 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2023-12-02 20:21:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 39 [2023-12-02 20:21:31,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:31,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-12-02 20:21:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:32,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:32,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_436))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-12-02 20:21:32,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:32,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:32,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:32,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:32,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6122 treesize of output 6076 [2023-12-02 20:21:32,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1509 treesize of output 1445 [2023-12-02 20:21:32,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1405 treesize of output 1341 [2023-12-02 20:21:32,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1321 treesize of output 1305 [2023-12-02 20:21:32,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-02 20:21:33,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:33,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:33,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:33,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:33,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2023-12-02 20:21:33,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:21:33,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2023-12-02 20:21:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 20:21:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639380498] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:34,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:34,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2023-12-02 20:21:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32751797] [2023-12-02 20:21:34,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:34,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:21:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:21:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=927, Unknown=2, NotChecked=62, Total=1122 [2023-12-02 20:21:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:34,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:34,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 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) [2023-12-02 20:21:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:34,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:34,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:34,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:37,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_432 Int) (v_ArrVal_431 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_37| Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_431) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_432) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_37|) 0))))) (and (forall ((v_ArrVal_436 (Array Int Int)) (|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_436))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (forall ((v_ArrVal_432 Int) (v_ArrVal_431 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_431) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (or (< c_~next_alloc_idx~0 65) .cse2) (forall ((|~#top~0.base| Int) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse3 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) (or (not (= c_~next_alloc_idx~0 0)) .cse2))) is different from false [2023-12-02 20:21:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 20:21:38,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:21:38,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 20:21:38,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:38,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 651532267, now seen corresponding path program 1 times [2023-12-02 20:21:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535933043] [2023-12-02 20:21:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535933043] [2023-12-02 20:21:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535933043] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209559922] [2023-12-02 20:21:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:39,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:39,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:21:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:39,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 20:21:39,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:39,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:39,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:39,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:39,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 20:21:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-12-02 20:21:39,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:21:39,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-02 20:21:39,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:21:39,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-02 20:21:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 20:21:39,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:39,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_540) |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_~oldTop~0#1|)) is different from false [2023-12-02 20:21:39,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-02 20:21:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-02 20:21:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209559922] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:39,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 26 [2023-12-02 20:21:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14256292] [2023-12-02 20:21:39,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:39,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 20:21:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:39,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 20:21:39,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=573, Unknown=1, NotChecked=48, Total=702 [2023-12-02 20:21:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:39,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:39,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:21:39,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:39,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:21:39,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:39,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-12-02 20:21:39,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:39,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-12-02 20:21:39,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-02 20:21:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:21:41,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:21:41,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 20:21:41,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:41,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1012740795, now seen corresponding path program 3 times [2023-12-02 20:21:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517578609] [2023-12-02 20:21:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 20:21:42,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517578609] [2023-12-02 20:21:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517578609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020644089] [2023-12-02 20:21:42,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:21:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:42,552 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:42,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:21:42,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:21:42,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:21:42,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:21:42,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:42,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:21:42,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:21:42,981 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 20:21:42,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-12-02 20:21:43,009 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-02 20:21:43,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2023-12-02 20:21:43,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 20:21:43,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 20:21:43,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-02 20:21:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 20:21:43,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:43,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_669 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_669))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse1) (or (not .cse1) (forall ((v_ArrVal_669 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_669))) (or (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))))) is different from false [2023-12-02 20:21:43,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_669 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_669))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) (or (forall ((v_ArrVal_669 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_669))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse0)))) is different from false [2023-12-02 20:21:43,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_669))) (or (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))) is different from false [2023-12-02 20:21:43,451 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 20:21:43,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 47 [2023-12-02 20:21:43,459 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:21:43,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2023-12-02 20:21:43,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:43,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2023-12-02 20:21:43,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2023-12-02 20:21:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2023-12-02 20:21:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020644089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:21:43,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:21:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-12-02 20:21:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955426663] [2023-12-02 20:21:43,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:21:43,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 20:21:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:21:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 20:21:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=490, Unknown=8, NotChecked=144, Total=756 [2023-12-02 20:21:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:43,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:21:43,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 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) [2023-12-02 20:21:43,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:21:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:21:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:21:44,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:21:44,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:44,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:44,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1861007563, now seen corresponding path program 2 times [2023-12-02 20:21:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:21:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072073651] [2023-12-02 20:21:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:21:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:21:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072073651] [2023-12-02 20:21:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072073651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:21:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579420142] [2023-12-02 20:21:46,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:21:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:46,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:21:46,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:21:47,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:21:47,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:21:47,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 20:21:47,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:47,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 20:21:47,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:21:47,441 INFO L349 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-12-02 20:21:47,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 33 [2023-12-02 20:21:47,570 INFO L349 Elim1Store]: treesize reduction 36, result has 55.0 percent of original size [2023-12-02 20:21:47,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 71 [2023-12-02 20:21:47,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 20:21:47,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 20:21:47,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 20:21:48,480 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-12-02 20:21:48,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 29 [2023-12-02 20:21:48,509 INFO L349 Elim1Store]: treesize reduction 50, result has 19.4 percent of original size [2023-12-02 20:21:48,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 39 [2023-12-02 20:21:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:48,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:49,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_853 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) (let ((.cse2 (store (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853))) (or (not (= (select (select (let ((.cse0 (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))))) (not .cse5)) (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853))) (or (not (= (select (select (let ((.cse6 (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse6) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse7 |c_~#top~0.base| .cse6) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= 0 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|)))))) .cse5)))) is different from false [2023-12-02 20:21:49,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_853 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) (let ((.cse2 (store (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853))) (or (not (= (select (select (let ((.cse0 (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= 0 (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|)))))))) (not .cse5)) (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853))) (or (not (= (select (select (let ((.cse6 (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |c_~#top~0.base| .cse6) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse7 |c_~#top~0.base| .cse6) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= 0 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|)))))) .cse5)))) is different from false [2023-12-02 20:21:49,376 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_853 (Array Int Int)) (|~#top~0.base| Int)) (let ((.cse3 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (let ((.cse1 (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) (let ((.cse2 (store (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853))) (or (not (= (select (select (let ((.cse0 (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| .cse1) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_853) |~#top~0.base| .cse0) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))))) is different from false [2023-12-02 20:21:49,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:49,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-12-02 20:21:49,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:49,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:21:50,070 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 20:21:50,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 864 treesize of output 644 [2023-12-02 20:21:50,384 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-02 20:21:50,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 20:21:50,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:21:50,585 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 20:21:50,589 INFO L158 Benchmark]: Toolchain (without parser) took 52274.97ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 119.0MB in the beginning and 204.0MB in the end (delta: -85.0MB). Peak memory consumption was 176.9MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,590 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 96.3MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:21:50,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.87ms. Allocated memory is still 155.2MB. Free memory was 118.7MB in the beginning and 98.6MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,591 INFO L158 Benchmark]: Boogie Preprocessor took 32.10ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 94.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,591 INFO L158 Benchmark]: RCFGBuilder took 584.39ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 66.8MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,592 INFO L158 Benchmark]: TraceAbstraction took 51150.49ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 66.0MB in the beginning and 204.0MB in the end (delta: -138.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2023-12-02 20:21:50,594 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 96.3MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.87ms. Allocated memory is still 155.2MB. Free memory was 118.7MB in the beginning and 98.6MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.10ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 94.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 584.39ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 66.8MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 51150.49ms. Allocated memory was 155.2MB in the beginning and 415.2MB in the end (delta: 260.0MB). Free memory was 66.0MB in the beginning and 204.0MB in the end (delta: -138.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-02 20:21:50,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-12-02 20:21:50,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:21:52,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:21:52,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2023-12-02 20:21:52,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:21:52,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:21:52,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:21:52,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:21:52,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:21:52,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:21:52,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:21:52,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:21:52,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:21:52,976 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:21:52,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:21:52,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:21:52,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:21:52,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:21:52,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:21:52,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:21:52,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:21:52,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:21:52,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 20:21:52,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 20:21:52,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:21:52,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:21:52,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:21:52,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:21:52,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:21:52,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:21:52,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:21:52,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:21:52,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:21:52,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:21:52,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:21:52,987 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-02 20:21:52,987 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:21:52,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 20:21:52,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:21:52,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:21:52,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:21:52,988 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:21:52,989 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:21:52,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:21:52,989 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/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_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2023-12-02 20:21:53,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:21:53,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:21:53,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:21:53,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:21:53,335 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:21:53,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-12-02 20:21:56,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:21:56,504 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:21:56,504 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-12-02 20:21:56,522 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/d18907c77/2a5dbc741e9547aab66514fc638a62d5/FLAG5ea0182a6 [2023-12-02 20:21:56,539 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/data/d18907c77/2a5dbc741e9547aab66514fc638a62d5 [2023-12-02 20:21:56,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:21:56,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:21:56,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:21:56,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:21:56,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:21:56,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:56" (1/1) ... [2023-12-02 20:21:56,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8bbaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:56, skipping insertion in model container [2023-12-02 20:21:56,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:56" (1/1) ... [2023-12-02 20:21:56,611 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:21:56,971 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2023-12-02 20:21:56,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:21:56,994 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:21:57,039 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2023-12-02 20:21:57,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:21:57,075 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:21:57,075 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:21:57,081 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:21:57,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57 WrapperNode [2023-12-02 20:21:57,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:21:57,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:21:57,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:21:57,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:21:57,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,136 INFO L138 Inliner]: procedures = 176, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2023-12-02 20:21:57,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:21:57,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:21:57,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:21:57,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:21:57,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:21:57,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:21:57,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:21:57,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:21:57,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (1/1) ... [2023-12-02 20:21:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:21:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:57,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:21:57,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:21:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 20:21:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-02 20:21:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-02 20:21:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 20:21:57,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:21:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:21:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:21:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 20:21:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 20:21:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 20:21:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 20:21:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:21:57,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:21:57,267 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:21:57,451 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:21:57,454 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:21:57,697 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:21:57,855 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:21:57,856 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 20:21:57,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:57 BoogieIcfgContainer [2023-12-02 20:21:57,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:21:57,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:21:57,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:21:57,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:21:57,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:21:56" (1/3) ... [2023-12-02 20:21:57,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279c7991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:57, skipping insertion in model container [2023-12-02 20:21:57,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:57" (2/3) ... [2023-12-02 20:21:57,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279c7991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:57, skipping insertion in model container [2023-12-02 20:21:57,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:57" (3/3) ... [2023-12-02 20:21:57,866 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-12-02 20:21:57,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:21:57,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:21:57,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 20:21:57,889 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:21:57,938 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:21:57,983 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:21:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:21:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:21:57,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:21:57,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:21:58,030 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:21:58,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-12-02 20:21:58,065 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7158e758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:21:58,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:21:58,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:21:58,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:21:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -306249253, now seen corresponding path program 1 times [2023-12-02 20:21:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:21:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045137690] [2023-12-02 20:21:58,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:21:58,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:21:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:21:58,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:21:58,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 20:21:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:21:58,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 20:21:58,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:21:58,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:21:58,895 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:21:58,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:21:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:21:59,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:21:59,292 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2023-12-02 20:21:59,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2023-12-02 20:21:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:21:59,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:21:59,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))) is different from false [2023-12-02 20:21:59,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#top~0.base| (_ BitVec 32)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_28 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_28))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2023-12-02 20:21:59,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:59,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:21:59,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:21:59,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:22:00,376 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-12-02 20:22:00,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1036 treesize of output 1001 [2023-12-02 20:22:00,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 346 [2023-12-02 20:22:00,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:22:00,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:00,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 961 treesize of output 927 [2023-12-02 20:22:00,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-12-02 20:22:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-02 20:22:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:22:01,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045137690] [2023-12-02 20:22:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045137690] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:01,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:01,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-12-02 20:22:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376814580] [2023-12-02 20:22:01,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:01,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 20:22:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 20:22:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=149, Unknown=3, NotChecked=50, Total=240 [2023-12-02 20:22:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:01,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) [2023-12-02 20:22:01,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:02,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|))) (.cse1 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (forall ((|~#top~0.base| (_ BitVec 32)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| .cse1)))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |~#top~0.base|) |c_~#top~0.offset|)))) (or .cse2 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse2) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| .cse1)))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))) is different from false [2023-12-02 20:22:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:22:02,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:22:02,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:02,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:02,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1101025085, now seen corresponding path program 1 times [2023-12-02 20:22:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544837529] [2023-12-02 20:22:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:22:02,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:02,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:02,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:02,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 20:22:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:22:02,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:22:02,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:03,062 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-12-02 20:22:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2023-12-02 20:22:03,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:22:03,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:22:03,143 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 20:22:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:22:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:22:03,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:22:03,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544837529] [2023-12-02 20:22:03,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544837529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:22:03,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:22:03,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:22:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131075107] [2023-12-02 20:22:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:22:03,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:22:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:22:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:22:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:03,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:03,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) [2023-12-02 20:22:03,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:22:03,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:04,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 20:22:04,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:04,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:04,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1262835877, now seen corresponding path program 2 times [2023-12-02 20:22:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562353200] [2023-12-02 20:22:04,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:22:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:04,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:04,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:04,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 20:22:04,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:22:04,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:22:04,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 20:22:04,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:04,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:22:05,000 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:22:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:22:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:05,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:22:05,451 INFO L349 Elim1Store]: treesize reduction 102, result has 32.5 percent of original size [2023-12-02 20:22:05,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 95 [2023-12-02 20:22:05,674 INFO L349 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2023-12-02 20:22:05,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2023-12-02 20:22:05,755 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:22:05,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:05,770 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:22:05,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:08,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:22:09,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#top~0.base| (_ BitVec 32)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_113))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) is different from false [2023-12-02 20:22:09,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:09,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:22:09,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:09,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:22:09,957 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-12-02 20:22:09,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1032 treesize of output 1001 [2023-12-02 20:22:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 346 [2023-12-02 20:22:10,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:22:10,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1285 treesize of output 1227 [2023-12-02 20:22:10,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-12-02 20:22:10,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-02 20:22:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:22:10,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562353200] [2023-12-02 20:22:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562353200] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:10,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-12-02 20:22:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014280497] [2023-12-02 20:22:10,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 20:22:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 20:22:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2023-12-02 20:22:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:10,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:10,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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) [2023-12-02 20:22:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:10,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:22:22,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 20:22:22,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:22,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:22,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1750977854, now seen corresponding path program 1 times [2023-12-02 20:22:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315007094] [2023-12-02 20:22:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:22:22,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:22,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:22,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 20:22:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:22:22,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 20:22:22,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:22,882 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:22:22,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:22:22,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:22:23,038 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-12-02 20:22:23,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2023-12-02 20:22:23,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:22:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-02 20:22:23,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 20:22:23,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:22:23,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:23,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2023-12-02 20:22:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:23,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:22:23,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_150) |c_~#top~0.base|) |c_~#top~0.offset|))) is different from false [2023-12-02 20:22:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-02 20:22:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:22:23,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315007094] [2023-12-02 20:22:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315007094] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:23,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-02 20:22:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638477638] [2023-12-02 20:22:23,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:23,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:22:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:22:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-12-02 20:22:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:23,389 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:23,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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) [2023-12-02 20:22:23,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:23,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:23,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-12-02 20:22:23,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:22:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:24,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 20:22:25,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:25,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:25,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1437880165, now seen corresponding path program 3 times [2023-12-02 20:22:25,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522216808] [2023-12-02 20:22:25,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:22:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:25,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:25,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 20:22:25,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:22:25,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:22:25,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 20:22:25,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:25,262 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:22:25,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:22:25,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:25,605 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 20:22:25,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:22:25,668 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-02 20:22:25,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2023-12-02 20:22:25,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 20:22:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:26,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:22:26,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not .cse2)) (or .cse2 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))))))) is different from false [2023-12-02 20:22:26,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))))))) is different from false [2023-12-02 20:22:26,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) is different from false [2023-12-02 20:22:26,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:26,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:22:26,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:26,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:22:26,942 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 20:22:26,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 148 [2023-12-02 20:22:27,000 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 20:22:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 229 [2023-12-02 20:22:27,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:27,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 143 [2023-12-02 20:22:27,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:27,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 137 [2023-12-02 20:22:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 126 [2023-12-02 20:22:27,364 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 20:22:27,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 56 [2023-12-02 20:22:27,377 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:22:27,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 88 [2023-12-02 20:22:27,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:27,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2023-12-02 20:22:27,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2023-12-02 20:22:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:27,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522216808] [2023-12-02 20:22:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522216808] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:27,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-12-02 20:22:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746882451] [2023-12-02 20:22:27,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:27,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 20:22:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 20:22:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=222, Unknown=10, NotChecked=96, Total=380 [2023-12-02 20:22:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:27,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:27,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 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) [2023-12-02 20:22:27,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:27,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:22:27,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:22:27,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:27,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:28,634 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (_ bv0 32) (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv0 32) (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))))) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select .cse2 |c_~#top~0.offset|))))) is different from false [2023-12-02 20:22:29,929 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (_ bv0 32) (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv0 32) (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))))) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_184))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not (= (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32)) (_ bv0 32))) (= |c_~#top~0.base| (_ bv3 32))) is different from false [2023-12-02 20:22:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:22:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:22:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:22:31,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 20:22:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:31,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:31,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash -405588218, now seen corresponding path program 1 times [2023-12-02 20:22:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569601226] [2023-12-02 20:22:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:22:31,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:31,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:31,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:31,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 20:22:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:22:31,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 20:22:31,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:31,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:22:31,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:22:31,965 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 20:22:31,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 20:22:31,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:22:32,043 INFO L349 Elim1Store]: treesize reduction 50, result has 24.2 percent of original size [2023-12-02 20:22:32,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2023-12-02 20:22:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-12-02 20:22:32,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 20:22:32,420 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:22:32,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:22:32,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:32,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:22:32,833 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2023-12-02 20:22:32,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2023-12-02 20:22:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:32,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:22:33,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_13) |c_~#top~0.base|) |c_~#top~0.offset|)))) .cse0) (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))) is different from false [2023-12-02 20:22:33,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_236))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) is different from false [2023-12-02 20:22:33,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:33,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:22:33,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:33,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:22:33,871 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-12-02 20:22:33,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1020 treesize of output 1001 [2023-12-02 20:22:33,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 346 [2023-12-02 20:22:34,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:22:34,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:22:34,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:34,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1133 treesize of output 1077 [2023-12-02 20:22:34,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 280 [2023-12-02 20:22:34,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-02 20:22:34,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:34,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-12-02 20:22:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 20:22:35,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569601226] [2023-12-02 20:22:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569601226] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:35,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:35,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-12-02 20:22:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751753007] [2023-12-02 20:22:35,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:35,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 20:22:35,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 20:22:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=317, Unknown=3, NotChecked=74, Total=462 [2023-12-02 20:22:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:35,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:35,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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) [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:22:35,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:44,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (and (not (= (_ bv0 32) (select .cse0 |c_~#top~0.offset|))) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_236))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) is different from false [2023-12-02 20:22:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:22:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:22:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 20:22:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:22:53,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 20:22:53,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:53,567 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:22:53,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:22:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1742690235, now seen corresponding path program 2 times [2023-12-02 20:22:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:22:53,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416627980] [2023-12-02 20:22:53,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:22:53,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:22:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:22:53,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:22:53,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 20:22:53,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:22:53,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:22:53,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:22:53,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:22:53,766 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:22:53,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:22:54,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:22:54,463 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 20:22:54,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:22:54,533 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-02 20:22:54,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2023-12-02 20:22:54,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 20:22:54,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-02 20:22:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:22:54,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:22:55,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))))) is different from false [2023-12-02 20:22:55,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (or (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not .cse0))))) is different from false [2023-12-02 20:22:55,356 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) is different from false [2023-12-02 20:22:55,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:22:55,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:55,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:22:55,845 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 20:22:55,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 148 [2023-12-02 20:22:55,912 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 20:22:55,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 165 [2023-12-02 20:22:55,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:55,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 141 [2023-12-02 20:22:55,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:55,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 137 [2023-12-02 20:22:56,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:22:56,417 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 20:22:56,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 56 [2023-12-02 20:22:56,429 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-02 20:22:56,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 88 [2023-12-02 20:22:56,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:56,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2023-12-02 20:22:56,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:56,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2023-12-02 20:22:56,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-12-02 20:22:57,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:22:57,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-12-02 20:22:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-02 20:22:57,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:22:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416627980] [2023-12-02 20:22:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416627980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:22:57,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:22:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-12-02 20:22:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662586239] [2023-12-02 20:22:57,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:22:57,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 20:22:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:22:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 20:22:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=9, NotChecked=120, Total=552 [2023-12-02 20:22:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:57,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:22:57,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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) [2023-12-02 20:22:57,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:22:57,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:22:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:22:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:22:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-12-02 20:22:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:22:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:22:57,955 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (= (_ bv3 32) c_~next_alloc_idx~0) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32)))) is different from false [2023-12-02 20:22:57,982 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (= (_ bv3 32) c_~next_alloc_idx~0) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2023-12-02 20:22:58,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (= (_ bv3 32) c_~next_alloc_idx~0) (or (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not .cse0)) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|))))) is different from false [2023-12-02 20:22:58,395 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (or (not .cse0) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (= (_ bv3 32) c_~next_alloc_idx~0) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|))))) is different from false [2023-12-02 20:22:59,071 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32)) (_ bv0 32))) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (= c_~next_alloc_idx~0 (_ bv5 32)) (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv0 32))) is different from false [2023-12-02 20:22:59,086 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (= c_~next_alloc_idx~0 (_ bv5 32))) is different from false [2023-12-02 20:22:59,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (or (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not .cse0)) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (= c_~next_alloc_idx~0 (_ bv5 32))))) is different from false [2023-12-02 20:22:59,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (or (not .cse0) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (= |c_~#top~0.base| (_ bv3 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (= c_~next_alloc_idx~0 (_ bv5 32))))) is different from false [2023-12-02 20:23:00,749 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (= (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32)) (_ bv0 32))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (= |c_~#top~0.base| (_ bv3 32)) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32)))) is different from false [2023-12-02 20:23:00,764 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32)))) is different from false [2023-12-02 20:23:00,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not .cse0)) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32)))))) is different from false [2023-12-02 20:23:00,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (= |c_~#top~0.offset| (_ bv0 32)) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (not .cse0) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32)))))) is different from false [2023-12-02 20:23:02,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:23:03,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (select .cse2 |c_~#top~0.offset|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| .cse4))) (and (= |c_~#top~0.offset| (_ bv0 32)) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (or (not .cse0) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (not (= (_ bv0 32) .cse4)) (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32))))))) is different from false [2023-12-02 20:23:03,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= (_ bv0 32) (select .cse1 |c_~#top~0.offset|))) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))))) is different from false [2023-12-02 20:23:05,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (and (= |c_~#top~0.offset| (_ bv0 32)) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (= (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) (not (= c_~next_alloc_idx~0 (_ bv0 32))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= |c_~#top~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= (_ bv0 32) (select .cse1 |c_~#top~0.offset|))) (= |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_310))) (or (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (not (bvsgt (bvadd c_~next_alloc_idx~0 (_ bv1 32)) (_ bv65 32))))) is different from false [2023-12-02 20:23:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 20:23:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:23:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:23:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:23:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 20:23:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:23:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-02 20:23:05,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 20:23:05,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:23:05,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:23:05,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:23:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2128157474, now seen corresponding path program 2 times [2023-12-02 20:23:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:23:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052291331] [2023-12-02 20:23:05,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:23:05,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:23:05,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:23:05,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:23:05,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 20:23:05,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:23:05,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:23:05,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:23:05,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:23:05,907 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:23:05,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 20:23:06,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 20:23:06,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:23:06,724 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2023-12-02 20:23:06,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-12-02 20:23:06,911 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-12-02 20:23:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 47 [2023-12-02 20:23:06,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:23:07,660 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 20:23:07,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 39 [2023-12-02 20:23:07,672 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:23:07,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 20:23:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:23:07,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:23:08,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (not (= (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))) is different from false [2023-12-02 20:23:08,704 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ BitVec 32)) (v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (_ bv0 32) (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389) |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))))) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ BitVec 32)) (v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389) |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (not (= (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32)))))))))) is different from false [2023-12-02 20:23:08,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ BitVec 32)) (v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389) |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))) (not (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))))))) (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ BitVec 32)) (v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389) |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))))) is different from false [2023-12-02 20:23:08,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ BitVec 32)) (v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389))) (or (not (= (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_389) |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))) is different from false [2023-12-02 20:23:09,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:23:09,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-12-02 20:23:09,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:23:09,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:23:11,247 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 20:23:11,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 265 treesize of output 263 [2023-12-02 20:23:11,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 249 [2023-12-02 20:23:11,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:23:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052291331] [2023-12-02 20:23:11,746 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-02 20:23:11,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 20:23:11,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:23:11,947 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 20:23:11,952 INFO L158 Benchmark]: Toolchain (without parser) took 75408.59ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 88.9MB in the beginning and 111.8MB in the end (delta: -22.9MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,952 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:23:11,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.48ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 67.6MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 113.2MB. Free memory was 67.6MB in the beginning and 65.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,953 INFO L158 Benchmark]: Boogie Preprocessor took 40.79ms. Allocated memory is still 113.2MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,954 INFO L158 Benchmark]: RCFGBuilder took 677.62ms. Allocated memory is still 113.2MB. Free memory was 62.7MB in the beginning and 60.5MB in the end (delta: 2.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,954 INFO L158 Benchmark]: TraceAbstraction took 74091.91ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 59.4MB in the beginning and 111.8MB in the end (delta: -52.4MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2023-12-02 20:23:11,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.48ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 67.6MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 113.2MB. Free memory was 67.6MB in the beginning and 65.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.79ms. Allocated memory is still 113.2MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 677.62ms. Allocated memory is still 113.2MB. Free memory was 62.7MB in the beginning and 60.5MB in the end (delta: 2.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 74091.91ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 59.4MB in the beginning and 111.8MB in the end (delta: -52.4MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-02 20:23:11,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-12-02 20:23:12,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e748b762-6fb8-48eb-8e8f-80f6a6e718ca/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index