./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2 --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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:20:56,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:20:56,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-02 11:20:56,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:20:56,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:20:56,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:20:56,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:20:56,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:20:56,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:20:56,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:20:56,986 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:20:56,986 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:20:56,987 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:20:56,989 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:20:56,990 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:20:56,990 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:20:56,991 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:20:56,991 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:20:56,992 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:20:56,992 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:20:56,992 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:20:56,997 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:20:56,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:20:56,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 11:20:56,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:20:56,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:20:56,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:20:56,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:20:57,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 11:20:57,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:20:57,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 11:20:57,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:20:57,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:20:57,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 11:20:57,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:20:57,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:20:57,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:20:57,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:20:57,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:20:57,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:20:57,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:20:57,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 11:20:57,005 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:20:57,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:20:57,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:20:57,006 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:20:57,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:20:57,007 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_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/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_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2024-11-02 11:20:57,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:20:57,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:20:57,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:20:57,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:20:57,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:20:57,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/xcsp/AllInterval-008.c Unable to find full path for "g++" [2024-11-02 11:20:59,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:20:59,809 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:20:59,812 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/sv-benchmarks/c/xcsp/AllInterval-008.c [2024-11-02 11:20:59,825 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/data/b215cfe8c/9948e302b3d74198980f85f71a9f1f32/FLAGa69a35de4 [2024-11-02 11:20:59,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/data/b215cfe8c/9948e302b3d74198980f85f71a9f1f32 [2024-11-02 11:20:59,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:20:59,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:20:59,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:20:59,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:20:59,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:20:59,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:20:59" (1/1) ... [2024-11-02 11:20:59,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419e518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:59, skipping insertion in model container [2024-11-02 11:20:59,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:20:59" (1/1) ... [2024-11-02 11:20:59,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:21:00,191 WARN L251 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_a1156aca-8a39-42f0-9632-f9215f0933c6/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-11-02 11:21:00,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:21:00,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:21:00,252 WARN L251 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_a1156aca-8a39-42f0-9632-f9215f0933c6/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-11-02 11:21:00,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:21:00,270 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:21:00,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00 WrapperNode [2024-11-02 11:21:00,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:21:00,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:21:00,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:21:00,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:21:00,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,330 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2024-11-02 11:21:00,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:21:00,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:21:00,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:21:00,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:21:00,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:21:00,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:21:00,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:21:00,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:21:00,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (1/1) ... [2024-11-02 11:21:00,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:21:00,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:21:00,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:21:00,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:21:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:21:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:21:00,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:21:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:21:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-02 11:21:00,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-02 11:21:00,655 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:21:00,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:21:01,186 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-02 11:21:01,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:21:01,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:21:01,236 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 11:21:01,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:21:01 BoogieIcfgContainer [2024-11-02 11:21:01,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:21:01,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:21:01,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:21:01,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:21:01,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:20:59" (1/3) ... [2024-11-02 11:21:01,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468a5d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:21:01, skipping insertion in model container [2024-11-02 11:21:01,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:21:00" (2/3) ... [2024-11-02 11:21:01,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468a5d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:21:01, skipping insertion in model container [2024-11-02 11:21:01,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:21:01" (3/3) ... [2024-11-02 11:21:01,249 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2024-11-02 11:21:01,264 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:21:01,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 11:21:01,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:21:01,376 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@61ee5db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:21:01,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 11:21:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-02 11:21:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-02 11:21:01,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:01,414 INFO L215 NwaCegarLoop]: trace histogram [86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:01,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 11:21:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 411573949, now seen corresponding path program 1 times [2024-11-02 11:21:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316573332] [2024-11-02 11:21:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:21:04,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 11:21:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:21:08,299 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 11:21:08,301 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 11:21:08,302 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 11:21:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:21:08,307 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-02 11:21:08,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 11:21:08,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:21:08 BoogieIcfgContainer [2024-11-02 11:21:08,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 11:21:08,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 11:21:08,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 11:21:08,469 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 11:21:08,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:21:01" (3/4) ... [2024-11-02 11:21:08,471 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 11:21:08,616 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 11:21:08,617 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 11:21:08,618 INFO L158 Benchmark]: Toolchain (without parser) took 8763.93ms. Allocated memory was 136.3MB in the beginning and 375.4MB in the end (delta: 239.1MB). Free memory was 93.2MB in the beginning and 220.6MB in the end (delta: -127.5MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,619 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 136.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:21:08,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.10ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 78.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.76ms. Allocated memory is still 136.3MB. Free memory was 78.5MB in the beginning and 76.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,620 INFO L158 Benchmark]: Boogie Preprocessor took 57.11ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,620 INFO L158 Benchmark]: RCFGBuilder took 847.76ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 74.7MB in the beginning and 146.1MB in the end (delta: -71.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,621 INFO L158 Benchmark]: TraceAbstraction took 7225.24ms. Allocated memory was 186.6MB in the beginning and 375.4MB in the end (delta: 188.7MB). Free memory was 145.1MB in the beginning and 233.2MB in the end (delta: -88.1MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,621 INFO L158 Benchmark]: Witness Printer took 150.26ms. Allocated memory is still 375.4MB. Free memory was 233.2MB in the beginning and 220.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-02 11:21:08,624 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.26ms. Allocated memory is still 136.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.10ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 78.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.76ms. Allocated memory is still 136.3MB. Free memory was 78.5MB in the beginning and 76.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.11ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 75.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 847.76ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 74.7MB in the beginning and 146.1MB in the end (delta: -71.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7225.24ms. Allocated memory was 186.6MB in the beginning and 375.4MB in the end (delta: 188.7MB). Free memory was 145.1MB in the beginning and 233.2MB in the end (delta: -88.1MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. * Witness Printer took 150.26ms. Allocated memory is still 375.4MB. Free memory was 233.2MB in the beginning and 220.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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 - CounterExampleResult [Line: 159]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L29] RET assume(var0 >= 0) VAL [var0=3] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L30] RET assume(var0 <= 7) VAL [var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L33] RET assume(var1 >= 0) VAL [var0=3, var1=6] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L34] RET assume(var1 <= 7) VAL [var0=3, var1=6] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L37] RET assume(var2 >= 0) VAL [var0=3, var1=6, var2=2] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L38] RET assume(var2 <= 7) VAL [var0=3, var1=6, var2=2] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L41] RET assume(var3 >= 0) VAL [var0=3, var1=6, var2=2, var3=4] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L42] RET assume(var3 <= 7) VAL [var0=3, var1=6, var2=2, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L45] RET assume(var4 >= 0) VAL [var0=3, var1=6, var2=2, var3=4, var4=5] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L46] RET assume(var4 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L49] RET assume(var5 >= 0) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L50] RET assume(var5 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L53] RET assume(var6 >= 0) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L54] RET assume(var6 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L57] RET assume(var7 >= 0) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L58] RET assume(var7 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L61] RET assume(var8 >= 1) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L62] RET assume(var8 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L65] RET assume(var9 >= 1) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L66] RET assume(var9 <= 7) VAL [var0=3, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L69] RET assume(var10 >= 1) VAL [var0=3, var10=2, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L70] RET assume(var10 <= 7) VAL [var0=3, var10=2, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L73] RET assume(var11 >= 1) VAL [var0=3, var10=2, var11=1, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L74] RET assume(var11 <= 7) VAL [var0=3, var10=2, var11=1, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L77] RET assume(var12 >= 1) VAL [var0=3, var10=2, var11=1, var12=5, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L78] RET assume(var12 <= 7) VAL [var0=3, var10=2, var11=1, var12=5, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L81] RET assume(var13 >= 1) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L82] RET assume(var13 <= 7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L85] RET assume(var14 >= 1) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L86] RET assume(var14 <= 7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L87] int myvar0 = 1; VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L88] RET assume(var0 != var1) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L89] RET assume(var0 != var2) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L90] RET assume(var0 != var3) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L91] RET assume(var0 != var4) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L92] RET assume(var0 != var5) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L93] RET assume(var0 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L94] RET assume(var0 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L95] RET assume(var1 != var2) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L96] RET assume(var1 != var3) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L97] RET assume(var1 != var4) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L98] RET assume(var1 != var5) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L99] RET assume(var1 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L100] RET assume(var1 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L101] RET assume(var2 != var3) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L102] RET assume(var2 != var4) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L103] RET assume(var2 != var5) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L104] RET assume(var2 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L105] RET assume(var2 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L106] RET assume(var3 != var4) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L107] RET assume(var3 != var5) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L108] RET assume(var3 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L109] RET assume(var3 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L110] RET assume(var4 != var5) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L111] RET assume(var4 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L112] RET assume(var4 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L113] RET assume(var5 != var6) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L114] RET assume(var5 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L115] RET assume(var6 != var7) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L116] RET assume(var8 != var9) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L117] RET assume(var8 != var10) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L118] RET assume(var8 != var11) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L119] RET assume(var8 != var12) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L120] RET assume(var8 != var13) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L121] RET assume(var8 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L122] RET assume(var9 != var10) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L123] RET assume(var9 != var11) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L124] RET assume(var9 != var12) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L125] RET assume(var9 != var13) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L126] RET assume(var9 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L127] RET assume(var10 != var11) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L128] RET assume(var10 != var12) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L129] RET assume(var10 != var13) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L130] RET assume(var10 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L131] RET assume(var11 != var12) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L132] RET assume(var11 != var13) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L133] RET assume(var11 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L134] RET assume(var12 != var13) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L135] RET assume(var12 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L136] RET assume(var13 != var14) VAL [var0=3, var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=3] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L140] RET assume(var8 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var1=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=3] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=4] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L143] RET assume(var9 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var2=2, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=4] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=2] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L146] RET assume(var10 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var3=4, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=2] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=1] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L149] RET assume(var11 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var4=5, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=1] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=5] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L152] RET assume(var12 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var5=0, var6=7, var7=1, var8=3, var9=4, var_for_abs=5] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var6=7, var7=1, var8=3, var9=4, var_for_abs=7] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L155] RET assume(var13 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var6=7, var7=1, var8=3, var9=4, var_for_abs=7] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var8=3, var9=4, var_for_abs=6] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L158] RET assume(var14 == var_for_abs) VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var8=3, var9=4, var_for_abs=6] [L159] reach_error() VAL [var10=2, var11=1, var12=5, var13=7, var14=6, var8=3, var9=4, var_for_abs=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 1, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2024-11-02 11:21:08,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1156aca-8a39-42f0-9632-f9215f0933c6/bin/utaipan-verify-DbMuA5NWw2/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE