./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya --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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:12:05,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:05,507 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:12:05,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:05,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:05,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:05,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:05,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:05,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:05,537 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:05,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:05,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:05,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:05,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:05,540 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:05,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:05,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:12:05,541 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:12:05,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:12:05,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:12:05,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:05,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:12:05,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:05,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:12:05,545 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:12:05,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:12:05,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:05,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:05,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:05,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:05,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:05,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:05,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:05,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:05,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:12:05,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:05,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:05,550 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_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/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_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2023-11-29 04:12:05,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:05,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:05,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:05,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:05,774 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:05,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-29 04:12:08,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:08,711 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:08,712 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-29 04:12:08,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/data/bc517d95a/fa7ba2f54cf348b780f5dbffcc37e37c/FLAG94e9e74bd [2023-11-29 04:12:08,734 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/data/bc517d95a/fa7ba2f54cf348b780f5dbffcc37e37c [2023-11-29 04:12:08,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:08,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:08,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:08,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:08,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:08,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:08" (1/1) ... [2023-11-29 04:12:08,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6083d9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:08, skipping insertion in model container [2023-11-29 04:12:08,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:08" (1/1) ... [2023-11-29 04:12:08,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:08,948 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_ab1f16e1-ff77-4778-ba81-8831d0064651/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-29 04:12:08,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:08,965 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:08,997 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_ab1f16e1-ff77-4778-ba81-8831d0064651/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-29 04:12:08,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:09,013 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:09,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09 WrapperNode [2023-11-29 04:12:09,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:09,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:09,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:09,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:09,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,062 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2023-11-29 04:12:09,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:09,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:09,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:09,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:09,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:12:09,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:09,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:09,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:09,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:09,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (1/1) ... [2023-11-29 04:12:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:09,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:09,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:12:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:09,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:12:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-29 04:12:09,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-29 04:12:09,253 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:09,255 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:09,534 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:09,559 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:09,560 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:12:09,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:09 BoogieIcfgContainer [2023-11-29 04:12:09,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:09,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:09,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:09,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:09,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:08" (1/3) ... [2023-11-29 04:12:09,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1e087f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:09, skipping insertion in model container [2023-11-29 04:12:09,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:09" (2/3) ... [2023-11-29 04:12:09,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1e087f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:09, skipping insertion in model container [2023-11-29 04:12:09,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:09" (3/3) ... [2023-11-29 04:12:09,569 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2023-11-29 04:12:09,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:09,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:12:09,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:09,637 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;@2390e027, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:09,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:12:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:12:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2023-11-29 04:12:09,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:09,667 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:09,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:09,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1018465269, now seen corresponding path program 1 times [2023-11-29 04:12:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:09,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865198948] [2023-11-29 04:12:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:12:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 04:12:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:12:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:12:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 04:12:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 04:12:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:12:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 04:12:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 04:12:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 04:12:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 04:12:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 04:12:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 04:12:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:12:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 04:12:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 04:12:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:12:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 04:12:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 04:12:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:12:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:12:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 04:12:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 04:12:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 04:12:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 04:12:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 04:12:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 04:12:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 04:12:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 04:12:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 04:12:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 04:12:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 04:12:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 04:12:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 04:12:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 04:12:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-29 04:12:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 04:12:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 04:12:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 04:12:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 04:12:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 04:12:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 04:12:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-29 04:12:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 04:12:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 04:12:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 04:12:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 04:12:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 04:12:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-29 04:12:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 04:12:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-11-29 04:12:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 04:12:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-11-29 04:12:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-11-29 04:12:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-11-29 04:12:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-11-29 04:12:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-11-29 04:12:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2023-11-29 04:12:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-11-29 04:12:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-11-29 04:12:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-11-29 04:12:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-11-29 04:12:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-29 04:12:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2023-11-29 04:12:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-11-29 04:12:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2023-11-29 04:12:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-11-29 04:12:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2023-11-29 04:12:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-11-29 04:12:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-11-29 04:12:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-11-29 04:12:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2023-11-29 04:12:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2023-11-29 04:12:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2023-11-29 04:12:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2023-11-29 04:12:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-11-29 04:12:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2023-11-29 04:12:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2023-11-29 04:12:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2023-11-29 04:12:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2023-11-29 04:12:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2023-11-29 04:12:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2023-11-29 04:12:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2023-11-29 04:12:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2023-11-29 04:12:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2023-11-29 04:12:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2023-11-29 04:12:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2023-11-29 04:12:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865198948] [2023-11-29 04:12:10,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865198948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:10,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:10,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587962745] [2023-11-29 04:12:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:10,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:12:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:12:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:12:10,387 INFO L87 Difference]: Start difference. First operand has 116 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-11-29 04:12:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:10,442 INFO L93 Difference]: Finished difference Result 229 states and 485 transitions. [2023-11-29 04:12:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:12:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 454 [2023-11-29 04:12:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:10,455 INFO L225 Difference]: With dead ends: 229 [2023-11-29 04:12:10,456 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 04:12:10,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:12:10,465 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:10,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 04:12:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-29 04:12:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 27 states have (on average 1.0) internal successors, (27), 27 states have internal predecessors, (27), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-29 04:12:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 199 transitions. [2023-11-29 04:12:10,540 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 199 transitions. Word has length 454 [2023-11-29 04:12:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:10,541 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 199 transitions. [2023-11-29 04:12:10,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-11-29 04:12:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 199 transitions. [2023-11-29 04:12:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2023-11-29 04:12:10,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:10,556 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:10,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:12:10,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:10,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash -406206299, now seen corresponding path program 1 times [2023-11-29 04:12:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219930577] [2023-11-29 04:12:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:11,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:12:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:13,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:12:13,275 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:12:13,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:12:13,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:12:13,282 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 04:12:13,287 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:12:13,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:12:13 BoogieIcfgContainer [2023-11-29 04:12:13,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:12:13,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:12:13,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:12:13,393 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:12:13,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:09" (3/4) ... [2023-11-29 04:12:13,394 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:12:13,520 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:12:13,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:12:13,521 INFO L158 Benchmark]: Toolchain (without parser) took 4783.89ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 114.6MB in the beginning and 198.0MB in the end (delta: -83.4MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,522 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:13,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.28ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 101.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.76ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 99.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,523 INFO L158 Benchmark]: Boogie Preprocessor took 40.94ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 97.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,523 INFO L158 Benchmark]: RCFGBuilder took 455.53ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 120.3MB in the end (delta: -22.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,524 INFO L158 Benchmark]: TraceAbstraction took 3829.10ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 119.5MB in the beginning and 210.6MB in the end (delta: -91.0MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,524 INFO L158 Benchmark]: Witness Printer took 128.37ms. Allocated memory is still 264.2MB. Free memory was 210.6MB in the beginning and 198.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:12:13,526 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.19ms. Allocated memory is still 107.0MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.28ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 101.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.76ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 99.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.94ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 97.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.53ms. Allocated memory is still 151.0MB. Free memory was 97.8MB in the beginning and 120.3MB in the end (delta: -22.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3829.10ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 119.5MB in the beginning and 210.6MB in the end (delta: -91.0MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 128.37ms. Allocated memory is still 264.2MB. Free memory was 210.6MB in the beginning and 198.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 159]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=4] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 7) VAL [dummy=0, var0=4] [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=4, var1=3] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 7) VAL [dummy=0, var0=4, var1=3] [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=4, var1=3, var2=5] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5] [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=4, var1=3, var2=5, var3=2] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2] [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=4, var1=3, var2=5, var3=2, var4=6] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6] [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=4, var1=3, var2=5, var3=2, var4=6, var5=1] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0] [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=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1] [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=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=4, var10=3, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 7) VAL [dummy=0, var0=4, var10=3, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=4, var10=3, var11=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L87] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var8 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var8 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=1] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=1] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=2] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=2] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=3] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=3] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=4] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=4] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=5] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=5] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=6] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=6] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] [L159] reach_error() VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 198 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14620/14620 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-29 04:12:13,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab1f16e1-ff77-4778-ba81-8831d0064651/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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