./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:37:32,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:37:32,903 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:37:32,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:37:32,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:37:32,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:37:32,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:37:32,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:37:32,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:37:32,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:37:32,932 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:37:32,933 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:37:32,933 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:37:32,933 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:37:32,934 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:37:32,934 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:37:32,935 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:37:32,935 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:37:32,936 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:37:32,936 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:37:32,937 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:37:32,937 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:37:32,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:37:32,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:37:32,939 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:37:32,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:37:32,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:37:32,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:37:32,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:37:32,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:37:32,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:37:32,942 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:37:32,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:37:32,942 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:37:32,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:37:32,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:37:32,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:37:32,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:37:32,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:37:32,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:37:32,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:37:32,944 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:37:32,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:37:32,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:37:32,945 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:37:32,945 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:37:32,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:37:32,945 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-12-02 19:37:33,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:37:33,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:37:33,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:37:33,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:37:33,159 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:37:33,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-12-02 19:37:35,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:37:36,176 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:37:36,177 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-12-02 19:37:36,194 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/aacb33a32/175fe860dfed46a086314244fcff3679/FLAG47c9f9246 [2023-12-02 19:37:36,207 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/aacb33a32/175fe860dfed46a086314244fcff3679 [2023-12-02 19:37:36,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:37:36,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:37:36,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:36,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:37:36,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:37:36,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b31e556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36, skipping insertion in model container [2023-12-02 19:37:36,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,270 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:37:36,600 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-02 19:37:36,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:36,651 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:37:36,688 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-02 19:37:36,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:37:36,761 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:37:36,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36 WrapperNode [2023-12-02 19:37:36,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:37:36,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:37:36,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:37:36,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:37:36,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,807 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-12-02 19:37:36,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:37:36,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:37:36,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:37:36,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:37:36,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:37:36,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:37:36,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:37:36,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:37:36,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (1/1) ... [2023-12-02 19:37:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:37:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:36,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:37:36,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:37:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:37:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-02 19:37:36,910 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-02 19:37:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-02 19:37:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-02 19:37:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:37:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:37:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:37:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:37:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-02 19:37:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-02 19:37:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:37:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:37:36,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:37:37,052 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:37:37,055 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:37:37,380 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:37:37,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:37:37,443 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-02 19:37:37,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:37:37 BoogieIcfgContainer [2023-12-02 19:37:37,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:37:37,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:37:37,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:37:37,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:37:37,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:37:36" (1/3) ... [2023-12-02 19:37:37,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c524596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:37:37, skipping insertion in model container [2023-12-02 19:37:37,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:37:36" (2/3) ... [2023-12-02 19:37:37,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c524596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:37:37, skipping insertion in model container [2023-12-02 19:37:37,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:37:37" (3/3) ... [2023-12-02 19:37:37,455 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-12-02 19:37:37,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:37:37,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:37:37,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:37:37,527 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=FINITE_AUTOMATA, 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;@38c94ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:37:37,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:37:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-02 19:37:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:37:37,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:37,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:37,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:37,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-02 19:37:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:37,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133024963] [2023-12-02 19:37:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:37,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133024963] [2023-12-02 19:37:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133024963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:37,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:37:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130334695] [2023-12-02 19:37:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:37,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 19:37:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 19:37:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:37:37,728 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:37:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:37,798 INFO L93 Difference]: Finished difference Result 206 states and 369 transitions. [2023-12-02 19:37:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 19:37:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:37:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:37,809 INFO L225 Difference]: With dead ends: 206 [2023-12-02 19:37:37,809 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 19:37:37,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:37:37,818 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:37,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:37:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 19:37:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 19:37:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 19:37:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2023-12-02 19:37:37,864 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 8 [2023-12-02 19:37:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:37,865 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2023-12-02 19:37:37,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:37:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2023-12-02 19:37:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 19:37:37,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:37,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:37,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:37:37,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:37,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -896617474, now seen corresponding path program 1 times [2023-12-02 19:37:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166490687] [2023-12-02 19:37:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:38,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166490687] [2023-12-02 19:37:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166490687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:37:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376324291] [2023-12-02 19:37:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:38,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:37:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:38,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:37:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:37:38,091 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:38,271 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2023-12-02 19:37:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:37:38,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-02 19:37:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:38,273 INFO L225 Difference]: With dead ends: 99 [2023-12-02 19:37:38,274 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 19:37:38,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:37:38,275 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 168 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:38,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:37:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 19:37:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-02 19:37:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 19:37:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-12-02 19:37:38,293 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 15 [2023-12-02 19:37:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:38,294 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-12-02 19:37:38,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-12-02 19:37:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:37:38,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:38,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:38,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:37:38,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:38,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1010502954, now seen corresponding path program 1 times [2023-12-02 19:37:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537778475] [2023-12-02 19:37:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:38,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537778475] [2023-12-02 19:37:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537778475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:38,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:38,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:37:38,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909003283] [2023-12-02 19:37:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:38,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:37:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:37:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:37:38,711 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:39,402 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2023-12-02 19:37:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:37:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-02 19:37:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:39,406 INFO L225 Difference]: With dead ends: 183 [2023-12-02 19:37:39,406 INFO L226 Difference]: Without dead ends: 177 [2023-12-02 19:37:39,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-02 19:37:39,408 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 342 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:39,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 438 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:37:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-02 19:37:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2023-12-02 19:37:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 19:37:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2023-12-02 19:37:39,442 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 18 [2023-12-02 19:37:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:39,442 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2023-12-02 19:37:39,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2023-12-02 19:37:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:37:39,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:39,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:39,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:37:39,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:39,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash -734298133, now seen corresponding path program 1 times [2023-12-02 19:37:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199025400] [2023-12-02 19:37:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:40,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199025400] [2023-12-02 19:37:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199025400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:37:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455460360] [2023-12-02 19:37:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:40,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:37:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:37:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:37:40,146 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:41,158 INFO L93 Difference]: Finished difference Result 253 states and 308 transitions. [2023-12-02 19:37:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:37:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-12-02 19:37:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:41,161 INFO L225 Difference]: With dead ends: 253 [2023-12-02 19:37:41,162 INFO L226 Difference]: Without dead ends: 250 [2023-12-02 19:37:41,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:37:41,164 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 296 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:41,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 147 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 19:37:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-02 19:37:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2023-12-02 19:37:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2613065326633166) internal successors, (251), 214 states have internal predecessors, (251), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:37:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2023-12-02 19:37:41,221 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 21 [2023-12-02 19:37:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:41,222 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2023-12-02 19:37:41,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2023-12-02 19:37:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:37:41,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:41,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:41,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:37:41,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:41,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1459497818, now seen corresponding path program 1 times [2023-12-02 19:37:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806154152] [2023-12-02 19:37:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:41,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806154152] [2023-12-02 19:37:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806154152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:37:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421042252] [2023-12-02 19:37:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:37:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:37:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:37:41,813 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:42,723 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2023-12-02 19:37:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:37:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-12-02 19:37:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:42,726 INFO L225 Difference]: With dead ends: 252 [2023-12-02 19:37:42,726 INFO L226 Difference]: Without dead ends: 249 [2023-12-02 19:37:42,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-02 19:37:42,728 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 335 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:42,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 147 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:37:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-02 19:37:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2023-12-02 19:37:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.256281407035176) internal successors, (250), 214 states have internal predecessors, (250), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:37:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2023-12-02 19:37:42,753 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 24 [2023-12-02 19:37:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:42,754 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2023-12-02 19:37:42,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2023-12-02 19:37:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 19:37:42,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:42,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:42,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 19:37:42,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:42,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2112541078, now seen corresponding path program 1 times [2023-12-02 19:37:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800809253] [2023-12-02 19:37:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:37:43,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800809253] [2023-12-02 19:37:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800809253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:37:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:37:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 19:37:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863748068] [2023-12-02 19:37:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:37:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:37:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:37:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:37:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:37:43,613 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:37:44,882 INFO L93 Difference]: Finished difference Result 251 states and 304 transitions. [2023-12-02 19:37:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:37:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-12-02 19:37:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:37:44,885 INFO L225 Difference]: With dead ends: 251 [2023-12-02 19:37:44,885 INFO L226 Difference]: Without dead ends: 248 [2023-12-02 19:37:44,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-12-02 19:37:44,887 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 335 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:37:44,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 175 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 19:37:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-12-02 19:37:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2023-12-02 19:37:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 214 states have internal predecessors, (249), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:37:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2023-12-02 19:37:44,914 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 27 [2023-12-02 19:37:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:37:44,915 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2023-12-02 19:37:44,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:37:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2023-12-02 19:37:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:37:44,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:37:44,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:37:44,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:37:44,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:37:44,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:37:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -849953334, now seen corresponding path program 1 times [2023-12-02 19:37:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:37:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628493620] [2023-12-02 19:37:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:37:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:37:45,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:37:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628493620] [2023-12-02 19:37:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628493620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:37:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468657587] [2023-12-02 19:37:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:45,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:37:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:45,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:37:45,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:37:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:45,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-02 19:37:45,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:46,070 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:37:46,071 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 19:37:46,103 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 19:37:46,103 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 19 treesize of output 16 [2023-12-02 19:37:46,115 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 19:37:46,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-12-02 19:37:46,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 19:37:46,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:46,656 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 23 treesize of output 14 [2023-12-02 19:37:46,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 22 [2023-12-02 19:37:46,764 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 19:37:46,765 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-12-02 19:37:46,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:37:46,785 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 19:37:46,898 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-12-02 19:37:46,924 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 19:37:46,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 103 [2023-12-02 19:37:46,978 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-12-02 19:37:47,003 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 19:37:47,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 103 [2023-12-02 19:37:47,066 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 125 [2023-12-02 19:37:47,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:47,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 118 [2023-12-02 19:37:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:47,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 68 [2023-12-02 19:37:47,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 68 [2023-12-02 19:37:47,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:47,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 68 [2023-12-02 19:37:47,271 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-12-02 19:37:47,297 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 19:37:47,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 103 [2023-12-02 19:37:47,350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-12-02 19:37:47,374 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-12-02 19:37:47,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 103 [2023-12-02 19:37:47,451 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2023-12-02 19:37:47,458 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 92 [2023-12-02 19:37:47,494 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-12-02 19:37:47,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 211 [2023-12-02 19:37:47,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 112 [2023-12-02 19:37:47,611 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115 [2023-12-02 19:37:47,622 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 40 treesize of output 1 [2023-12-02 19:37:47,644 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 127 [2023-12-02 19:37:47,658 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 46 treesize of output 1 [2023-12-02 19:37:49,720 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse13 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|)) (.cse17 (select |c_#memory_$Pointer$.base| |c_list_add_#in~new#1.base|)) (.cse6 (select |c_old(#memory_$Pointer$.base)| .cse5))) (let ((.cse0 (= |c_list_add_#in~head#1.base| .cse5)) (.cse28 (= |c_list_add_#in~new#1.base| .cse5)) (.cse10 (+ (- 4) |c_list_add_#in~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse11 (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))) (.cse22 (select |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base|)) (.cse15 (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~new#1.base| .cse17)) (.cse4 (+ |c_list_add_#in~new#1.offset| 4)) (.cse21 (not .cse13))) (or (and .cse0 (or (and (or (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_14) .cse5 v_DerPreprocessor_15)) (.cse3 (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|))) (and (= .cse1 (store (select (store .cse2 |c_list_add_#in~new#1.base| (store (store (select .cse2 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse3) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse2 |c_list_add_#in~head#1.base|) v_DerPreprocessor_14) (exists ((v_ArrVal_375 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse3 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|))))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_13 |c_list_add_#in~head#1.offset|)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse5 v_DerPreprocessor_13))) (and (= .cse1 (store (select (store .cse7 |c_list_add_#in~new#1.base| (store (store (select .cse7 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse8) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse8 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (= (select .cse7 |c_list_add_#in~head#1.base|) v_DerPreprocessor_12)))) (and (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse5 v_DerPreprocessor_13))) (and (= .cse1 (store (select (store .cse9 |c_list_add_#in~new#1.base| (store (store (select .cse9 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse9 |c_list_add_#in~head#1.base|) v_DerPreprocessor_12)))) .cse11) (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_14) .cse5 v_DerPreprocessor_15))) (and (= .cse1 (store (select (store .cse12 |c_list_add_#in~new#1.base| (store (store (select .cse12 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse12 |c_list_add_#in~head#1.base|) v_DerPreprocessor_14)))) .cse11)) .cse13) (and (or (exists ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse16 (+ (select v_arrayElimArr_14 |c_list_add_#in~new#1.offset|) 4))) (and (= (select v_arrayElimArr_14 .cse4) |c_list_add_#in~head#1.offset|) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_16) |c_list_add_#in~head#1.base| v_DerPreprocessor_17) |c_list_add_#in~new#1.base| v_arrayElimArr_14))) (and (= .cse1 (store (select .cse14 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse14 .cse5) v_DerPreprocessor_16)))) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse16 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= |c_list_add_#in~head#1.offset| .cse16)))) (exists ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_14 |c_list_add_#in~new#1.offset|))) (and (= (select v_arrayElimArr_14 .cse4) |c_list_add_#in~head#1.offset|) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_16) |c_list_add_#in~head#1.base| v_DerPreprocessor_17) |c_list_add_#in~new#1.base| v_arrayElimArr_14))) (let ((.cse19 (select .cse20 .cse5))) (and (= .cse18 (select .cse19 |c_list_add_#in~head#1.offset|)) (= .cse1 (store (select .cse20 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= .cse19 v_DerPreprocessor_16))))) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse18 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) .cse21))) (and (let ((.cse25 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_19) .cse5 v_DerPreprocessor_20))) (let ((.cse24 (select (select .cse23 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (= .cse22 (store (select (store .cse23 |c_list_add_#in~new#1.base| (store (store (select .cse23 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse24) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (store .cse25 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse24 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|))))) .cse13) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_21) |c_list_add_#in~head#1.base| v_DerPreprocessor_22) .cse5 v_DerPreprocessor_23))) (let ((.cse26 (select (select .cse27 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store .cse25 |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ 4 .cse26) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse22 (store (select (store (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_22) .cse5 v_DerPreprocessor_23) |c_list_add_#in~new#1.base| (store (store (select .cse27 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse26) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))))) .cse21))) (not .cse28) (not .cse0)) (and .cse28 (or (and (or (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5))) (and (= v_DerPreprocessor_4 (select .cse29 |c_list_add_#in~head#1.base|)) (= .cse1 (store (select (store .cse29 |c_list_add_#in~new#1.base| (store (store (select .cse29 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|))))) .cse11) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7)) (.cse31 (select v_DerPreprocessor_7 |c_list_add_#in~head#1.offset|))) (and (= (select .cse30 |c_list_add_#in~head#1.base|) v_DerPreprocessor_6) (exists ((v_ArrVal_375 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse31 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|)) (= .cse1 (store (select (store .cse30 |c_list_add_#in~new#1.base| (store (store (select .cse30 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse31) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5)) (.cse33 (select v_DerPreprocessor_5 |c_list_add_#in~head#1.offset|))) (and (= v_DerPreprocessor_4 (select .cse32 |c_list_add_#in~head#1.base|)) (= .cse1 (store (select (store .cse32 |c_list_add_#in~new#1.base| (store (store (select .cse32 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse33) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse33 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7))) (and (= (store (select (store .cse34 |c_list_add_#in~new#1.base| (store (store (select .cse34 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse1) (= (select .cse34 |c_list_add_#in~head#1.base|) v_DerPreprocessor_6)))) .cse11)) .cse13) (and (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse36 (select .cse39 |c_list_add_#in~head#1.base|))) (let ((.cse38 (select .cse36 |c_list_add_#in~head#1.offset|))) (let ((.cse35 (+ .cse38 4)) (.cse37 (select .cse39 .cse5))) (and (not (= |c_list_add_#in~new#1.offset| .cse35)) (= (store .cse36 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse35 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse37 v_DerPreprocessor_8) (= |c_list_add_#in~head#1.offset| (select .cse37 .cse4)) (= (select .cse37 |c_list_add_#in~new#1.offset|) .cse38) (not (= |c_list_add_#in~new#1.offset| .cse38)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse40 (select .cse44 |c_list_add_#in~head#1.base|))) (let ((.cse43 (select .cse40 |c_list_add_#in~head#1.offset|))) (let ((.cse42 (select .cse44 .cse5)) (.cse41 (+ .cse43 4))) (and (= (store .cse40 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse41 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse42 v_DerPreprocessor_8) (= |c_list_add_#in~head#1.offset| (select .cse42 .cse4)) (= (select .cse42 |c_list_add_#in~new#1.offset|) .cse43) (= |c_list_add_#in~new#1.offset| .cse41))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse45 (select .cse48 |c_list_add_#in~head#1.base|))) (let ((.cse47 (select .cse48 .cse5)) (.cse46 (select .cse45 |c_list_add_#in~head#1.offset|))) (and (= (store .cse45 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse46 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse47 v_DerPreprocessor_8) (= |c_list_add_#in~new#1.offset| .cse46) (= |c_list_add_#in~head#1.offset| (select .cse47 .cse4)) (= (select .cse47 |c_list_add_#in~new#1.offset|) .cse46))))))) .cse21))))))) (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|)) is different from false [2023-12-02 19:37:50,127 INFO L349 Elim1Store]: treesize reduction 308, result has 4.6 percent of original size [2023-12-02 19:37:50,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 680 treesize of output 1127 [2023-12-02 19:37:50,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:50,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:50,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:50,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:50,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:50,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:50,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:50,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:50,560 INFO L349 Elim1Store]: treesize reduction 5093, result has 0.0 percent of original size [2023-12-02 19:37:50,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 19 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 23 new quantified variables, introduced 60 case distinctions, treesize of input 4419 treesize of output 11418 [2023-12-02 19:37:51,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 8759 treesize of output 8100 [2023-12-02 19:37:52,163 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:37:52,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:52,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:52,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:52,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:52,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:52,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:37:52,269 INFO L349 Elim1Store]: treesize reduction 245, result has 0.4 percent of original size [2023-12-02 19:37:52,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 1081 treesize of output 1064 [2023-12-02 19:37:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 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 2055 treesize of output 1666 [2023-12-02 19:37:55,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:55,752 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 1235 treesize of output 1218 [2023-12-02 19:37:56,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:56,438 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1043 treesize of output 1128 [2023-12-02 19:37:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:59,161 INFO L349 Elim1Store]: treesize reduction 526, result has 4.9 percent of original size [2023-12-02 19:37:59,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5262 treesize of output 4942 [2023-12-02 19:38:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:01,370 INFO L349 Elim1Store]: treesize reduction 526, result has 4.9 percent of original size [2023-12-02 19:38:01,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5330 treesize of output 4990 [2023-12-02 19:38:01,977 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:38:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:04,494 INFO L349 Elim1Store]: treesize reduction 510, result has 7.8 percent of original size [2023-12-02 19:38:04,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5310 treesize of output 5006 [2023-12-02 19:38:08,034 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:38:08,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 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 2229 treesize of output 1810 [2023-12-02 19:38:11,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:12,012 INFO L349 Elim1Store]: treesize reduction 463, result has 0.6 percent of original size [2023-12-02 19:38:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2935 treesize of output 2580 [2023-12-02 19:38:12,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:12,294 INFO L349 Elim1Store]: treesize reduction 448, result has 0.7 percent of original size [2023-12-02 19:38:12,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 1638 treesize of output 1720 [2023-12-02 19:38:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:14,247 INFO L349 Elim1Store]: treesize reduction 152, result has 6.7 percent of original size [2023-12-02 19:38:14,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 6403 treesize of output 6334 [2023-12-02 19:38:14,792 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:38:14,995 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2023-12-02 19:38:14,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 90 [2023-12-02 19:38:15,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2023-12-02 19:38:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1734149674] [2023-12-02 19:38:15,038 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 19:38:15,038 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:15,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:38:15,044 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:38:15,044 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:38:15,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:15,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:15,271 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2598cd5d at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.newQuantifier(SymbolicTools.java:284) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.projectExistentially(SymbolicTools.java:270) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:117) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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 19:38:15,274 INFO L158 Benchmark]: Toolchain (without parser) took 39063.40ms. Allocated memory was 151.0MB in the beginning and 383.8MB in the end (delta: 232.8MB). Free memory was 110.2MB in the beginning and 239.0MB in the end (delta: -128.8MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,274 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:38:15,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.10ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 82.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,274 INFO L158 Benchmark]: Boogie Preprocessor took 36.60ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 77.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,275 INFO L158 Benchmark]: RCFGBuilder took 599.48ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.7MB in the beginning and 143.1MB in the end (delta: -65.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,275 INFO L158 Benchmark]: TraceAbstraction took 37824.47ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 143.1MB in the beginning and 239.0MB in the end (delta: -95.8MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2023-12-02 19:38:15,276 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.18ms. Allocated memory is still 113.2MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.10ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 82.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.60ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 77.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.48ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.7MB in the beginning and 143.1MB in the end (delta: -65.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 37824.47ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 143.1MB in the beginning and 239.0MB in the end (delta: -95.8MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2598cd5d de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2598cd5d: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-02 19:38:15,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:38:17,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:38:17,234 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 19:38:17,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:38:17,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:38:17,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:38:17,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:38:17,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:38:17,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:38:17,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:38:17,273 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:38:17,273 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:38:17,274 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:38:17,274 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:38:17,275 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:38:17,276 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:38:17,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:38:17,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:38:17,278 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:38:17,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:38:17,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:38:17,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:38:17,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:38:17,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:38:17,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:38:17,281 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 19:38:17,282 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 19:38:17,282 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:38:17,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:38:17,283 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:38:17,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:38:17,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 19:38:17,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:38:17,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:38:17,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:38:17,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:38:17,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:38:17,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:38:17,285 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 19:38:17,286 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 19:38:17,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:38:17,287 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:38:17,287 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:38:17,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:38:17,287 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-12-02 19:38:17,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:38:17,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:38:17,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:38:17,618 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:38:17,619 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:38:17,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-12-02 19:38:20,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:38:20,692 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:38:20,693 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-12-02 19:38:20,709 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/4c0a4fad8/de07f5db4acb411d9fabfcd84329d047/FLAGfea25a0c3 [2023-12-02 19:38:20,722 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/data/4c0a4fad8/de07f5db4acb411d9fabfcd84329d047 [2023-12-02 19:38:20,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:38:20,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:38:20,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:38:20,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:38:20,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:38:20,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:38:20" (1/1) ... [2023-12-02 19:38:20,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c1e1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:20, skipping insertion in model container [2023-12-02 19:38:20,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:38:20" (1/1) ... [2023-12-02 19:38:20,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:38:21,132 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-02 19:38:21,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:38:21,189 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 19:38:21,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:38:21,225 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-02 19:38:21,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:38:21,248 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:38:21,278 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_1b101296-27ae-456b-8e75-c5b037e0f9ef/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-02 19:38:21,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:38:21,344 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:38:21,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21 WrapperNode [2023-12-02 19:38:21,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:38:21,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:38:21,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:38:21,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:38:21,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,396 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2023-12-02 19:38:21,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:38:21,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:38:21,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:38:21,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:38:21,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:38:21,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:38:21,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:38:21,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:38:21,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (1/1) ... [2023-12-02 19:38:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:38:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:21,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:38:21,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:38:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 19:38:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:38:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-02 19:38:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-02 19:38:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:38:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 19:38:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 19:38:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 19:38:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-02 19:38:21,572 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-02 19:38:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-02 19:38:21,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-02 19:38:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:38:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:38:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:38:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-02 19:38:21,573 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-02 19:38:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:38:21,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:38:21,718 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:38:21,720 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:38:22,207 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:38:22,260 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:38:22,260 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-02 19:38:22,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:22 BoogieIcfgContainer [2023-12-02 19:38:22,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:38:22,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:38:22,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:38:22,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:38:22,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:38:20" (1/3) ... [2023-12-02 19:38:22,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c2e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:38:22, skipping insertion in model container [2023-12-02 19:38:22,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:21" (2/3) ... [2023-12-02 19:38:22,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c2e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:38:22, skipping insertion in model container [2023-12-02 19:38:22,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:22" (3/3) ... [2023-12-02 19:38:22,268 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-12-02 19:38:22,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:38:22,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:38:22,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:38:22,330 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=FINITE_AUTOMATA, 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;@cf087a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:38:22,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:38:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-02 19:38:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:38:22,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:22,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:22,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:22,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-02 19:38:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741728007] [2023-12-02 19:38:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:22,355 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 19:38:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:22,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:22,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 (2)] Waiting until timeout for monitored process [2023-12-02 19:38:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:22,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 19:38:22,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:22,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:22,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741728007] [2023-12-02 19:38:22,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741728007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:22,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:22,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:38:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612001164] [2023-12-02 19:38:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:22,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 19:38:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 19:38:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:38:22,531 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:38:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:22,676 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-12-02 19:38:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 19:38:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:38:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:22,687 INFO L225 Difference]: With dead ends: 210 [2023-12-02 19:38:22,687 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 19:38:22,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:38:22,695 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:22,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:38:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 19:38:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-02 19:38:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 19:38:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-02 19:38:22,742 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-12-02 19:38:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:22,768 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-02 19:38:22,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:38:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-02 19:38:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:38:22,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:22,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:22,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:22,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:22,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:22,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-12-02 19:38:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286364272] [2023-12-02 19:38:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:22,975 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 19:38:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:22,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:22,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:23,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:38:23,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:23,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:23,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286364272] [2023-12-02 19:38:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286364272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:38:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206564460] [2023-12-02 19:38:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:23,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:38:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:38:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:38:23,197 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:23,560 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-02 19:38:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:38:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-02 19:38:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:23,564 INFO L225 Difference]: With dead ends: 101 [2023-12-02 19:38:23,564 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 19:38:23,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:38:23,566 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:23,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:38:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 19:38:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 19:38:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 19:38:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-02 19:38:23,588 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-12-02 19:38:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:23,589 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-02 19:38:23,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-02 19:38:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:38:23,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:23,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:23,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 19:38:23,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:23,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:23,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-12-02 19:38:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955028896] [2023-12-02 19:38:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:23,796 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 19:38:23,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:23,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:23,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:23,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 19:38:23,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:24,037 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:24,038 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 19:38:24,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:38:24,115 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 0 case distinctions, treesize of input 62 treesize of output 66 [2023-12-02 19:38:24,142 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 19 treesize of output 7 [2023-12-02 19:38:24,163 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 25 treesize of output 26 [2023-12-02 19:38:24,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2023-12-02 19:38:24,193 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 19:38:24,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 19:38:24,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2023-12-02 19:38:24,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 1 [2023-12-02 19:38:24,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,246 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 103 [2023-12-02 19:38:24,259 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 34 treesize of output 27 [2023-12-02 19:38:24,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-02 19:38:24,284 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 28 treesize of output 11 [2023-12-02 19:38:24,290 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 19:38:24,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:38:24,316 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-12-02 19:38:24,316 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 2 case distinctions, treesize of input 103 treesize of output 91 [2023-12-02 19:38:24,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 72 treesize of output 1 [2023-12-02 19:38:24,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 72 treesize of output 1 [2023-12-02 19:38:24,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 1 [2023-12-02 19:38:24,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,383 INFO L349 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2023-12-02 19:38:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 128 [2023-12-02 19:38:24,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 55 treesize of output 1 [2023-12-02 19:38:24,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:38:24,408 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2023-12-02 19:38:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 42 [2023-12-02 19:38:24,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 1 [2023-12-02 19:38:24,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 19:38:24,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-02 19:38:24,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 103 [2023-12-02 19:38:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 34 treesize of output 27 [2023-12-02 19:38:24,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-12-02 19:38:24,609 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:38:24,609 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 25 treesize of output 26 [2023-12-02 19:38:24,740 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 16 treesize of output 8 [2023-12-02 19:38:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:24,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:24,763 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955028896] [2023-12-02 19:38:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955028896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:38:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909580872] [2023-12-02 19:38:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:24,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:38:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:38:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:38:24,766 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:26,661 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-12-02 19:38:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:38:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-02 19:38:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:26,665 INFO L225 Difference]: With dead ends: 187 [2023-12-02 19:38:26,665 INFO L226 Difference]: Without dead ends: 181 [2023-12-02 19:38:26,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-12-02 19:38:26,667 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 426 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:26,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 500 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 19:38:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-02 19:38:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-12-02 19:38:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 19:38:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-12-02 19:38:26,711 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-12-02 19:38:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:26,711 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-12-02 19:38:26,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-12-02 19:38:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:38:26,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:26,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:26,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:26,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:26,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-12-02 19:38:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238332871] [2023-12-02 19:38:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:26,918 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 19:38:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:26,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:26,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:27,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:38:27,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:27,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:27,169 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 19:38:27,233 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 19:38:27,241 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 19:38:28,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 19:38:28,404 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2023-12-02 19:38:28,447 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 51 treesize of output 48 [2023-12-02 19:38:28,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2023-12-02 19:38:28,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:28,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:28,906 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 25 treesize of output 14 [2023-12-02 19:38:28,952 INFO L349 Elim1Store]: treesize reduction 26, result has 31.6 percent of original size [2023-12-02 19:38:28,952 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 139 treesize of output 122 [2023-12-02 19:38:28,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2023-12-02 19:38:28,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 15 [2023-12-02 19:38:29,542 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 16 treesize of output 8 [2023-12-02 19:38:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:29,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:29,648 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:29,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238332871] [2023-12-02 19:38:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238332871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:38:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078143274] [2023-12-02 19:38:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:29,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:38:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:38:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2023-12-02 19:38:29,650 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:35,664 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2023-12-02 19:38:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:38:35,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-02 19:38:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:35,667 INFO L225 Difference]: With dead ends: 260 [2023-12-02 19:38:35,667 INFO L226 Difference]: Without dead ends: 257 [2023-12-02 19:38:35,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2023-12-02 19:38:35,668 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 217 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 32 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:35,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 310 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 851 Invalid, 24 Unknown, 0 Unchecked, 5.6s Time] [2023-12-02 19:38:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-02 19:38:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2023-12-02 19:38:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 219 states have internal predecessors, (256), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:38:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 295 transitions. [2023-12-02 19:38:35,706 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 295 transitions. Word has length 23 [2023-12-02 19:38:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:35,706 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 295 transitions. [2023-12-02 19:38:35,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 295 transitions. [2023-12-02 19:38:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:38:35,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:35,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:35,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:35,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:35,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:35,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-12-02 19:38:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84493020] [2023-12-02 19:38:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:35,910 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 19:38:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:35,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:35,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:36,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:38:36,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:36,118 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:36,118 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 19:38:36,182 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 19:38:36,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 19:38:36,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 19:38:36,466 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2023-12-02 19:38:36,612 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 19:38:36,613 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 115 treesize of output 104 [2023-12-02 19:38:36,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2023-12-02 19:38:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:36,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:36,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84493020] [2023-12-02 19:38:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84493020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 19:38:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63641001] [2023-12-02 19:38:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:38:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:38:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-02 19:38:36,942 INFO L87 Difference]: Start difference. First operand 240 states and 295 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:41,070 INFO L93 Difference]: Finished difference Result 259 states and 312 transitions. [2023-12-02 19:38:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:38:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-12-02 19:38:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:41,073 INFO L225 Difference]: With dead ends: 259 [2023-12-02 19:38:41,073 INFO L226 Difference]: Without dead ends: 256 [2023-12-02 19:38:41,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:38:41,074 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 256 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 30 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:41,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 360 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 839 Invalid, 12 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 19:38:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-02 19:38:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2023-12-02 19:38:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.25) internal successors, (255), 219 states have internal predecessors, (255), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:38:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2023-12-02 19:38:41,107 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 26 [2023-12-02 19:38:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:41,107 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2023-12-02 19:38:41,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2023-12-02 19:38:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:38:41,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:41,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:41,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:41,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:41,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:41,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-12-02 19:38:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903248733] [2023-12-02 19:38:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:41,310 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 19:38:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:41,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:41,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:41,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:38:41,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:41,520 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:41,521 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 19:38:41,583 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 19:38:41,593 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 19:38:43,773 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 51 treesize of output 48 [2023-12-02 19:38:43,778 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2023-12-02 19:38:43,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 60 treesize of output 52 [2023-12-02 19:38:43,796 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 20 treesize of output 30 [2023-12-02 19:38:43,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-12-02 19:38:43,835 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-12-02 19:38:43,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 15 [2023-12-02 19:38:43,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-02 19:38:44,081 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 19:38:44,082 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 1 case distinctions, treesize of input 75 treesize of output 68 [2023-12-02 19:38:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:44,090 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 48 treesize of output 44 [2023-12-02 19:38:44,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2023-12-02 19:38:44,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 29 [2023-12-02 19:38:44,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2023-12-02 19:38:45,075 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-02 19:38:45,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 23 [2023-12-02 19:38:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:45,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:38:45,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903248733] [2023-12-02 19:38:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903248733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 19:38:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684015920] [2023-12-02 19:38:45,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:45,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 19:38:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:45,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 19:38:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:38:45,322 INFO L87 Difference]: Start difference. First operand 240 states and 294 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 19:38:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:57,875 INFO L93 Difference]: Finished difference Result 258 states and 310 transitions. [2023-12-02 19:38:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:38:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-12-02 19:38:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:57,877 INFO L225 Difference]: With dead ends: 258 [2023-12-02 19:38:57,877 INFO L226 Difference]: Without dead ends: 255 [2023-12-02 19:38:57,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-02 19:38:57,878 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:57,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 385 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 937 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2023-12-02 19:38:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-02 19:38:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-12-02 19:38:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2450980392156863) internal successors, (254), 219 states have internal predecessors, (254), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:38:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2023-12-02 19:38:57,913 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 29 [2023-12-02 19:38:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2023-12-02 19:38:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:38:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2023-12-02 19:38:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 19:38:57,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:57,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:57,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:58,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:58,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:58,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-12-02 19:38:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:58,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270768962] [2023-12-02 19:38:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:58,116 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 19:38:58,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:58,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:58,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:38:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:58,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:38:58,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:58,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:38:58,339 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 19:38:58,390 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 19:38:58,397 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 19:39:03,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 154 [2023-12-02 19:39:03,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 172 [2023-12-02 19:39:03,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:39:03,399 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 71 treesize of output 63 [2023-12-02 19:39:03,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 14 [2023-12-02 19:39:03,576 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 12 treesize of output 1 [2023-12-02 19:39:03,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 19:39:03,585 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2023-12-02 19:39:03,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 22 [2023-12-02 19:39:03,610 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 22 treesize of output 34 [2023-12-02 19:39:04,189 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2023-12-02 19:39:04,189 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 153 treesize of output 117 [2023-12-02 19:39:04,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:39:04,208 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 40 treesize of output 39 [2023-12-02 19:39:04,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 51 [2023-12-02 19:39:04,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2023-12-02 19:39:05,450 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 52 treesize of output 32 [2023-12-02 19:39:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:39:05,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:39:05,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:39:05,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270768962] [2023-12-02 19:39:05,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270768962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:39:05,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:39:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 19:39:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940264292] [2023-12-02 19:39:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:39:05,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 19:39:05,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:39:05,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 19:39:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:39:05,937 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:39:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:33,333 INFO L93 Difference]: Finished difference Result 257 states and 308 transitions. [2023-12-02 19:39:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:39:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-02 19:39:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:33,336 INFO L225 Difference]: With dead ends: 257 [2023-12-02 19:39:33,336 INFO L226 Difference]: Without dead ends: 254 [2023-12-02 19:39:33,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-02 19:39:33,337 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 243 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:33,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 405 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 926 Invalid, 1 Unknown, 0 Unchecked, 25.6s Time] [2023-12-02 19:39:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-02 19:39:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-02 19:39:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2401960784313726) internal successors, (253), 219 states have internal predecessors, (253), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 19:39:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2023-12-02 19:39:33,373 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 32 [2023-12-02 19:39:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:33,373 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2023-12-02 19:39:33,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 19:39:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2023-12-02 19:39:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 19:39:33,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:33,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:39:33,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:39:33,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:39:33,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:39:33,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-12-02 19:39:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:39:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694331975] [2023-12-02 19:39:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:33,577 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 19:39:33,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:39:33,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:39:33,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:39:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:33,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:39:33,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:33,880 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 19:39:33,880 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 21 treesize of output 20 [2023-12-02 19:39:33,955 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 19:39:33,967 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 19:39:34,463 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 53 treesize of output 50 [2023-12-02 19:39:34,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2023-12-02 19:39:34,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:39:34,637 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 23 treesize of output 14 [2023-12-02 19:39:34,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 22 [2023-12-02 19:39:34,774 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 19:39:34,775 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 19:39:34,849 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 28 treesize of output 19 [2023-12-02 19:39:35,504 WARN L876 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (let ((.cse10 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|))) (let ((.cse0 (not .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_list_add_#in~new#1.base|)) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (or (and .cse0 (exists ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (|list_add_~new#1.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_468))) (store .cse3 |c_list_add_#in~new#1.base| (let ((.cse5 (bvadd |list_add_~new#1.offset| (_ bv4 32)))) (store (store (select .cse3 |c_list_add_#in~new#1.base|) |list_add_~new#1.offset| (select .cse4 |list_add_~new#1.offset|)) .cse5 (select .cse4 .cse5))))))) (store .cse1 |c_list_add_#in~head#1.base| (store (select .cse1 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| .cse2)))))) (and .cse0 (exists ((|list_add_~new#1.offset| (_ BitVec 32)) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (and (not (= |list_add_~new#1.offset| |c_list_add_#in~head#1.offset|)) (= |c_#memory_$Pointer$.base| (let ((.cse7 (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_468))) (store .cse8 |c_list_add_#in~new#1.base| (let ((.cse9 (bvadd |list_add_~new#1.offset| (_ bv4 32)))) (store (store (select .cse8 |c_list_add_#in~new#1.base|) |list_add_~new#1.offset| (select .cse4 |list_add_~new#1.offset|)) .cse9 (select .cse4 .cse9))))))) (store .cse7 |c_list_add_#in~head#1.base| (store (select .cse7 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| .cse2))))))) (and .cse10 (exists ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse11 (let ((.cse12 (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_468))) (store .cse12 |c_list_add_#in~new#1.base| (let ((.cse13 (bvadd (_ bv4 32) |c_list_add_#in~head#1.offset|))) (store (select .cse12 |c_list_add_#in~new#1.base|) .cse13 (select .cse4 .cse13))))))) (store .cse11 |c_list_add_#in~head#1.base| (store (select .cse11 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| .cse2))) |c_#memory_$Pointer$.base|))) (exists ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (|list_add_~new#1.offset| (_ BitVec 32))) (let ((.cse16 (bvadd |list_add_~new#1.offset| (_ bv4 32)))) (and (not (= |list_add_~new#1.offset| |c_list_add_#in~head#1.offset|)) (= |c_#memory_$Pointer$.base| (let ((.cse14 (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_468))) (store .cse15 |c_list_add_#in~new#1.base| (store (store (select .cse15 |c_list_add_#in~new#1.base|) |list_add_~new#1.offset| (select .cse4 |list_add_~new#1.offset|)) .cse16 (select .cse4 .cse16)))))) (store .cse14 |c_list_add_#in~head#1.base| (store (select .cse14 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| .cse2)))) (not (= .cse16 |c_list_add_#in~head#1.offset|))))) (and .cse10 (exists ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (let ((.cse17 (let ((.cse18 (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_468))) (store .cse18 |c_list_add_#in~new#1.base| (let ((.cse19 (bvadd (_ bv4294967292 32) |c_list_add_#in~head#1.offset|))) (store (select .cse18 |c_list_add_#in~new#1.base|) .cse19 (select .cse4 .cse19))))))) (store .cse17 |c_list_add_#in~head#1.base| (store (select .cse17 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| .cse2)))))))))) is different from true [2023-12-02 19:39:35,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:41:18,447 WARN L293 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 143 DAG size of output: 55 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 19:41:18,447 INFO L349 Elim1Store]: treesize reduction 612, result has 15.1 percent of original size [2023-12-02 19:41:18,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 15 new quantified variables, introduced 12 case distinctions, treesize of input 714 treesize of output 2177 [2023-12-02 19:41:18,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1770 treesize of output 1421 [2023-12-02 19:41:50,186 INFO L224 Elim1Store]: Index analysis took 24901 ms [2023-12-02 19:41:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 349 [2023-12-02 19:42:00,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:42:23,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:42:38,527 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select (select v_arrayElimArr_39 (_ bv3 32)) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| (_ bv3 32)) (_ bv0 32)))) (= (select (store (store (store v_arrayElimArr_41 .cse0 v_DerPreprocessor_24) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_25) (_ bv3 32) (store v_prenex_4 (_ bv0 32) .cse1)) .cse0) (select (store (store (store v_arrayElimArr_46 .cse0 v_DerPreprocessor_27) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32) (store v_ArrVal_468 (_ bv0 32) .cse1)) |ULTIMATE.start_gl_insert_~node~1#1.base|))) [2023-12-02 19:42:56,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:42:57,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:07,865 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:11,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:39,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:56,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:43:58,407 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select (select v_arrayElimArr_39 (_ bv3 32)) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| (_ bv3 32)) (_ bv0 32)))) (= (select (store (store (store v_arrayElimArr_41 .cse0 v_DerPreprocessor_21) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_22) (_ bv3 32) (store v_ArrVal_468 (_ bv0 32) .cse1)) .cse0) (select (store (store (store v_arrayElimArr_39 .cse0 v_DerPreprocessor_33) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_34) (_ bv3 32) (store v_prenex_4 (_ bv0 32) .cse1)) |ULTIMATE.start_gl_insert_~node~1#1.base|))) [2023-12-02 19:44:02,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:44:16,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:44:32,895 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select (select v_arrayElimArr_39 (_ bv3 32)) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| (_ bv3 32)) (_ bv0 32)))) (= (select (store (store (store v_arrayElimArr_45 .cse0 v_DerPreprocessor_30) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) (_ bv3 32) (store v_prenex_2 (_ bv0 32) .cse1)) |ULTIMATE.start_gl_insert_~node~1#1.base|) (select (store (store (store v_arrayElimArr_41 .cse0 v_DerPreprocessor_21) |ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_22) (_ bv3 32) (store v_ArrVal_468 (_ bv0 32) .cse1)) |ULTIMATE.start_gl_insert_~node~1#1.base|))) [2023-12-02 19:44:54,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:45:06,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:45:17,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:45:23,251 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:45:24,026 INFO L224 Elim1Store]: Index analysis took 205270 ms [2023-12-02 19:45:33,131 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 97 DAG size of output: 12 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 19:45:33,131 INFO L349 Elim1Store]: treesize reduction 421, result has 2.8 percent of original size [2023-12-02 19:45:33,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 23 case distinctions, treesize of input 780 treesize of output 1884 [2023-12-02 19:46:53,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:46:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694331975] [2023-12-02 19:46:53,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2023-12-02 19:46:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824441087] [2023-12-02 19:46:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:46:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:46:53,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:46:53,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-02 19:46:53,464 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4eda6081 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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 19:46:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655525705] [2023-12-02 19:46:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:46:53,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:46:53,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:46:53,467 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:46:53,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:46:53,539 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4eda6081 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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 19:46:53,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:46:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 19:46:53,541 ERROR L171 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2023-12-02 19:46:53,541 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 19:46:53,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 19:46:53,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-02 19:46:53,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:46:53,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:46:54,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/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 19:46:54,150 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:46:54,153 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:46:54,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:46:54 BoogieIcfgContainer [2023-12-02 19:46:54,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:46:54,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:46:54,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:46:54,168 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:46:54,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:22" (3/4) ... [2023-12-02 19:46:54,170 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 19:46:54,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:46:54,172 INFO L158 Benchmark]: Toolchain (without parser) took 513446.31ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 107.4MB in the beginning and 114.2MB in the end (delta: -6.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,172 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 73.4MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:46:54,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.83ms. Allocated memory is still 132.1MB. Free memory was 106.9MB in the beginning and 71.7MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.52ms. Allocated memory is still 132.1MB. Free memory was 71.7MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,173 INFO L158 Benchmark]: Boogie Preprocessor took 99.76ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 108.7MB in the end (delta: -39.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,173 INFO L158 Benchmark]: RCFGBuilder took 762.67ms. Allocated memory is still 132.1MB. Free memory was 108.7MB in the beginning and 74.4MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,173 INFO L158 Benchmark]: TraceAbstraction took 511903.86ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 74.4MB in the beginning and 114.2MB in the end (delta: -39.8MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2023-12-02 19:46:54,173 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 159.4MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:46:54,175 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.27ms. Allocated memory is still 73.4MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.83ms. Allocated memory is still 132.1MB. Free memory was 106.9MB in the beginning and 71.7MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.52ms. Allocated memory is still 132.1MB. Free memory was 71.7MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.76ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 108.7MB in the end (delta: -39.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * RCFGBuilder took 762.67ms. Allocated memory is still 132.1MB. Free memory was 108.7MB in the beginning and 74.4MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 511903.86ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 74.4MB in the beginning and 114.2MB in the end (delta: -39.8MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 159.4MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 840]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->prev = (&node->nested) [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND TRUE __VERIFIER_nondet_int() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->prev = (&node->nested) [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) [L853] COND FALSE !(!(head)) [L854] EXPR head->next [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev [L855] COND TRUE !(head->prev != head) [L855] CALL fail() [L840] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 511.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 mSolverCounterUnknown, 1572 SdHoareTripleChecker+Valid, 48.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1558 mSDsluCounter, 2286 SdHoareTripleChecker+Invalid, 47.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1870 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4076 IncrementalHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 416 mSDtfsCounter, 4076 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=4, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 455.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 5 QuantifiedInterpolants, 5183 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1037 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 19:46:54,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b101296-27ae-456b-8e75-c5b037e0f9ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN