./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-007.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX --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 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:45:59,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:45:59,334 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:45:59,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:45:59,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:45:59,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:45:59,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:45:59,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:45:59,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:45:59,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:45:59,368 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:45:59,369 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:45:59,370 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:45:59,370 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:45:59,371 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:45:59,371 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:45:59,372 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:45:59,372 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:45:59,373 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:45:59,374 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:45:59,374 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:45:59,375 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:45:59,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:45:59,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:45:59,377 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:45:59,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:45:59,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:45:59,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:45:59,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:45:59,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:45:59,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:45:59,381 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:45:59,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:45:59,382 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:45:59,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:45:59,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:45:59,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:45:59,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:45:59,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:45:59,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:45:59,389 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:45:59,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:45:59,390 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:45:59,390 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:45:59,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:45:59,391 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_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/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_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX 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 -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2023-11-12 00:45:59,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:45:59,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:45:59,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:45:59,717 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:45:59,717 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:45:59,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/xcsp/AllInterval-007.c [2023-11-12 00:46:02,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:46:03,166 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:46:03,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/sv-benchmarks/c/xcsp/AllInterval-007.c [2023-11-12 00:46:03,179 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/data/29f4ed064/d6908461707d473180de543550f6637b/FLAG69c0bae4a [2023-11-12 00:46:03,201 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/data/29f4ed064/d6908461707d473180de543550f6637b [2023-11-12 00:46:03,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:46:03,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:46:03,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:46:03,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:46:03,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:46:03,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1249e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03, skipping insertion in model container [2023-11-12 00:46:03,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,266 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:46:03,522 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_57d01722-c91f-4b05-9afd-83c87a57c769/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2023-11-12 00:46:03,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:46:03,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:46:03,604 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_57d01722-c91f-4b05-9afd-83c87a57c769/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2023-11-12 00:46:03,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:46:03,623 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:46:03,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03 WrapperNode [2023-11-12 00:46:03,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:46:03,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:46:03,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:46:03,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:46:03,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,674 INFO L138 Inliner]: procedures = 13, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2023-11-12 00:46:03,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:46:03,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:46:03,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:46:03,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:46:03,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:46:03,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:46:03,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:46:03,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:46:03,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (1/1) ... [2023-11-12 00:46:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:46:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:03,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:46:03,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:46:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:46:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:46:03,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:46:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:46:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-12 00:46:03,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-12 00:46:03,848 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:46:03,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:46:04,181 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:46:04,208 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:46:04,209 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 00:46:04,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:04 BoogieIcfgContainer [2023-11-12 00:46:04,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:46:04,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:46:04,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:46:04,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:46:04,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:46:03" (1/3) ... [2023-11-12 00:46:04,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a0c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:46:04, skipping insertion in model container [2023-11-12 00:46:04,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:46:03" (2/3) ... [2023-11-12 00:46:04,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a0c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:46:04, skipping insertion in model container [2023-11-12 00:46:04,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:04" (3/3) ... [2023-11-12 00:46:04,222 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2023-11-12 00:46:04,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:46:04,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:46:04,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:46:04,315 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;@2d075035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:46:04,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:46:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-12 00:46:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-12 00:46:04,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:04,343 INFO L195 NwaCegarLoop]: trace histogram [68, 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] [2023-11-12 00:46:04,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:46:04,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2122885294, now seen corresponding path program 1 times [2023-11-12 00:46:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225432983] [2023-11-12 00:46:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:46:05,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:46:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:46:06,591 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:46:06,593 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:46:06,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 00:46:06,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:46:06,601 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-12 00:46:06,608 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:46:06,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:46:06 BoogieIcfgContainer [2023-11-12 00:46:06,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:46:06,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:46:06,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:46:06,733 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:46:06,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:46:04" (3/4) ... [2023-11-12 00:46:06,735 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 00:46:06,870 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:46:06,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:46:06,872 INFO L158 Benchmark]: Toolchain (without parser) took 3658.95ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.8MB in the beginning and 82.9MB in the end (delta: 25.9MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,872 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 102.8MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:46:06,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.27ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 96.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.70ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,874 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,874 INFO L158 Benchmark]: RCFGBuilder took 507.51ms. Allocated memory is still 153.1MB. Free memory was 92.8MB in the beginning and 119.8MB in the end (delta: -27.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,875 INFO L158 Benchmark]: TraceAbstraction took 2517.52ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 119.2MB in the beginning and 91.3MB in the end (delta: 27.9MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,875 INFO L158 Benchmark]: Witness Printer took 137.87ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 82.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 00:46:06,878 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.34ms. Allocated memory is still 102.8MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.27ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 96.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.70ms. Allocated memory is still 153.1MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.51ms. Allocated memory is still 153.1MB. Free memory was 92.8MB in the beginning and 119.8MB in the end (delta: -27.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2517.52ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 119.2MB in the beginning and 91.3MB in the end (delta: 27.9MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * Witness Printer took 137.87ms. Allocated memory is still 184.5MB. Free memory was 91.3MB in the beginning and 82.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 135]: 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 [dummy=0, var0=0] [L30] CALL assume(var0 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L30] RET assume(var0 <= 6) VAL [dummy=0, var0=0] [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 [dummy=0, var0=0, var1=6] [L34] CALL assume(var1 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L34] RET assume(var1 <= 6) VAL [dummy=0, var0=0, 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 [dummy=0, var0=0, var1=6, var2=1] [L38] CALL assume(var2 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L38] RET assume(var2 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5] [L42] CALL assume(var3 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L42] RET assume(var3 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2] [L46] CALL assume(var4 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L46] RET assume(var4 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4] [L50] CALL assume(var5 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L50] RET assume(var5 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3] [L54] CALL assume(var6 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L54] RET assume(var6 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6] [L58] CALL assume(var7 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L58] RET assume(var7 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5] [L62] CALL assume(var8 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L62] RET assume(var8 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5] [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 [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L66] CALL assume(var9 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L66] RET assume(var9 <= 6) VAL [dummy=0, var0=0, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, 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 [dummy=0, var0=0, var10=3, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L70] CALL assume(var10 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L70] RET assume(var10 <= 6) VAL [dummy=0, var0=0, var10=3, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, 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 [dummy=0, var0=0, var10=3, var11=2, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L74] CALL assume(var11 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L74] RET assume(var11 <= 6) VAL [dummy=0, var0=0, var10=3, var11=2, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, 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 [dummy=0, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L78] CALL assume(var12 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L78] RET assume(var12 <= 6) VAL [dummy=0, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L79] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L80] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L80] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L81] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L81] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L82] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L82] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L83] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L83] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L84] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L84] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L85] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L85] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L86] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L86] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L87] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L87] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L88] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L88] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L89] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L89] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L90] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L90] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L91] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L91] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L92] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L92] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L93] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L93] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L94] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L94] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L95] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L95] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L96] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L96] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L97] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L97] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L98] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L98] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L99] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L99] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L100] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L100] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L101] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L101] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L102] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L102] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L103] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L103] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L104] CALL assume(var7 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L104] RET assume(var7 != var11) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L105] CALL assume(var7 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L105] RET assume(var7 != var12) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L106] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L106] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L107] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L107] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L108] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L108] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L109] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L109] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L110] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L110] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L111] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L111] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L112] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L112] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L113] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L113] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L114] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L114] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L115] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L115] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4] [L116] int var_for_abs; [L117] var_for_abs = var0 - var1 [L118] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=6] [L119] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L119] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=6] [L120] var_for_abs = var1 - var2 [L121] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=5] [L122] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L122] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=5] [L123] var_for_abs = var2 - var3 [L124] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=4] [L125] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L125] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=4] [L126] var_for_abs = var3 - var4 [L127] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=3] [L128] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L128] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=3] [L129] var_for_abs = var4 - var5 [L130] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=2] [L131] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L131] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=2] [L132] var_for_abs = var5 - var6 [L133] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=1] [L134] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L134] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=1] [L135] reach_error() VAL [dummy=0, myvar0=1, var0=0, var10=3, var11=2, var12=1, var1=6, var2=1, var3=5, var4=2, var5=4, var6=3, var7=6, var8=5, var9=4, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 1, TraceHistogramMax: 68, 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=93occurred 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, 1.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 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! [2023-11-12 00:46:06,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d01722-c91f-4b05-9afd-83c87a57c769/bin/utaipan-verify-NcY6lQBIFX/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