./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-006.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-006.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:44:32,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:44:32,852 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:44:32,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:44:32,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:44:32,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:44:32,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:44:32,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:44:32,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:44:32,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:44:32,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:44:32,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:44:32,916 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:44:32,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:44:32,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:44:32,917 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:44:32,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:44:32,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:44:32,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:44:32,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:44:32,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:44:32,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:44:32,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:44:32,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:44:32,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:44:32,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:44:32,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:44:32,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:44:32,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:32,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:44:32,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:44:32,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:44:32,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:44:32,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:44:32,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:44:32,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:44:32,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:44:32,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:44:32,929 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:44:32,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/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_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu 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 -> Automizer 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 -> 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f [2023-11-19 07:44:33,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:44:33,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:44:33,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:44:33,338 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:44:33,338 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:44:33,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/xcsp/AllInterval-006.c [2023-11-19 07:44:36,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:44:36,845 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:44:36,846 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/sv-benchmarks/c/xcsp/AllInterval-006.c [2023-11-19 07:44:36,856 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/data/5b593c8f8/97fe649761a442fdb826562bcc4cca03/FLAGf89d225ec [2023-11-19 07:44:36,877 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/data/5b593c8f8/97fe649761a442fdb826562bcc4cca03 [2023-11-19 07:44:36,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:44:36,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:44:36,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:36,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:44:36,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:44:36,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:36" (1/1) ... [2023-11-19 07:44:36,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33dabcca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:36, skipping insertion in model container [2023-11-19 07:44:36,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:36" (1/1) ... [2023-11-19 07:44:36,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:44:37,091 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_58652d6c-f210-45ad-ad21-8ec19b631b6a/sv-benchmarks/c/xcsp/AllInterval-006.c[3098,3111] [2023-11-19 07:44:37,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:37,109 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:44:37,137 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_58652d6c-f210-45ad-ad21-8ec19b631b6a/sv-benchmarks/c/xcsp/AllInterval-006.c[3098,3111] [2023-11-19 07:44:37,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:37,154 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:44:37,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37 WrapperNode [2023-11-19 07:44:37,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:37,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:37,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:44:37,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:44:37,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,204 INFO L138 Inliner]: procedures = 13, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2023-11-19 07:44:37,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:37,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:44:37,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:44:37,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:44:37,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:44:37,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:44:37,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:44:37,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:44:37,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (1/1) ... [2023-11-19 07:44:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:37,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:37,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:37,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:44:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:44:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:44:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:44:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:44:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-19 07:44:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-19 07:44:37,436 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:44:37,440 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:44:37,815 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:44:37,827 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:44:37,827 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:44:37,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:37 BoogieIcfgContainer [2023-11-19 07:44:37,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:44:37,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:44:37,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:44:37,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:44:37,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:44:36" (1/3) ... [2023-11-19 07:44:37,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d56ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:37, skipping insertion in model container [2023-11-19 07:44:37,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:37" (2/3) ... [2023-11-19 07:44:37,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d56ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:37, skipping insertion in model container [2023-11-19 07:44:37,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:37" (3/3) ... [2023-11-19 07:44:37,843 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-006.c [2023-11-19 07:44:37,863 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:44:37,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:44:37,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:44:37,929 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=PETRI_NET, 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;@3ff396d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:44:37,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:44:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-19 07:44:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-11-19 07:44:37,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:44:37,958 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:44:37,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:37,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1686358427, now seen corresponding path program 1 times [2023-11-19 07:44:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:37,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723893995] [2023-11-19 07:44:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:39,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:39,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:39,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:44:39,817 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:44:39,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:44:39,825 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-19 07:44:39,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:44:39,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:44:39 BoogieIcfgContainer [2023-11-19 07:44:39,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:44:39,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:44:39,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:44:39,949 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:44:39,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:37" (3/4) ... [2023-11-19 07:44:39,951 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:44:40,053 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:44:40,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:44:40,054 INFO L158 Benchmark]: Toolchain (without parser) took 3172.91ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 132.6MB in the beginning and 88.9MB in the end (delta: 43.7MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,055 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 139.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:44:40,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.09ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 120.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 172.0MB. Free memory was 120.5MB in the beginning and 118.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,056 INFO L158 Benchmark]: Boogie Preprocessor took 26.38ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 117.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:44:40,056 INFO L158 Benchmark]: RCFGBuilder took 600.47ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 102.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,057 INFO L158 Benchmark]: TraceAbstraction took 2113.01ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 101.2MB in the beginning and 96.2MB in the end (delta: 4.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,057 INFO L158 Benchmark]: Witness Printer took 104.08ms. Allocated memory is still 207.6MB. Free memory was 96.2MB in the beginning and 88.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:44:40,059 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.32ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 139.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.09ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 120.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 172.0MB. Free memory was 120.5MB in the beginning and 118.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.38ms. Allocated memory is still 172.0MB. Free memory was 118.5MB in the beginning and 117.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 600.47ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 102.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2113.01ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 101.2MB in the beginning and 96.2MB in the end (delta: 4.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Witness Printer took 104.08ms. Allocated memory is still 207.6MB. Free memory was 96.2MB in the beginning and 88.9MB in the end (delta: 7.3MB). 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: 113]: 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) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 5) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=1] [L34] CALL assume(var1 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 5) VAL [dummy=0, var0=3, var1=1] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=1, var2=2] [L38] CALL assume(var2 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5] [L42] CALL assume(var3 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0] [L46] CALL assume(var4 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4] [L50] CALL assume(var5 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2] [L54] CALL assume(var6 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1] [L58] CALL assume(var7 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3] [L62] CALL assume(var8 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, 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) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L66] CALL assume(var9 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 5) VAL [dummy=0, var0=3, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L70] CALL assume(var10 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 5) VAL [dummy=0, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L71] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L72] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L73] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L74] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L75] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L76] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L77] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L78] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L79] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L80] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L81] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L82] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L83] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L84] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L85] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L86] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L87] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L88] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L89] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L90] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var6 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L91] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L92] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L93] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L94] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L95] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L96] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5] [L97] int var_for_abs; [L98] var_for_abs = var0 - var1 [L99] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=2] [L100] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=2] [L101] var_for_abs = var1 - var2 [L102] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=1] [L103] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=1] [L104] var_for_abs = var2 - var3 [L105] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=3] [L106] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=3] [L107] var_for_abs = var3 - var4 [L108] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=5] [L109] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=5] [L110] var_for_abs = var4 - var5 [L111] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=4] [L112] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=4] [L113] reach_error() VAL [dummy=0, myvar0=1, var0=3, var10=4, var1=1, var2=2, var3=5, var4=0, var5=4, var6=2, var7=1, var8=3, var9=5, var_for_abs=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 1, TraceHistogramMax: 52, 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=79occurred 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 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-19 07:44:40,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58652d6c-f210-45ad-ad21-8ec19b631b6a/bin/uautomizer-verify-uCwYo4JHxu/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