./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-010.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-010.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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 bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:41:49,535 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:41:49,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:41:49,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:41:49,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:41:49,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:41:49,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:41:49,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:41:49,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:41:49,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:41:49,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:41:49,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:41:49,721 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:41:49,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:41:49,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:41:49,724 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:41:49,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:41:49,725 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:41:49,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:41:49,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:41:49,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:41:49,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:41:49,728 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:41:49,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:41:49,729 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:41:49,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:41:49,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:41:49,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:41:49,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:41:49,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:41:49,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:41:49,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:41:49,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:41:49,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:41:49,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:41:49,734 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:41:49,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:41:49,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:41:49,735 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:41:49,736 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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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 -> bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2
[2023-11-19 07:41:50,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:41:50,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:41:50,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:41:50,046 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:41:50,047 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:41:50,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/xcsp/AllInterval-010.c
[2023-11-19 07:41:53,275 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:41:53,475 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:41:53,475 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/sv-benchmarks/c/xcsp/AllInterval-010.c
[2023-11-19 07:41:53,485 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/data/c96608d1e/b0e62e5db8174da380473cec6bd4d906/FLAGbae411669
[2023-11-19 07:41:53,500 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/data/c96608d1e/b0e62e5db8174da380473cec6bd4d906
[2023-11-19 07:41:53,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:41:53,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:41:53,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:41:53,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:41:53,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:41:53,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12efb132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53, skipping insertion in model container
[2023-11-19 07:41:53,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,549 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:41:53,780 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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791]
[2023-11-19 07:41:53,787 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:41:53,798 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:41:53,839 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_9cbfdcae-d42a-41f8-86a5-e094926a6d40/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791]
[2023-11-19 07:41:53,841 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:41:53,856 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:41:53,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53 WrapperNode
[2023-11-19 07:41:53,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:41:53,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:41:53,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:41:53,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:41:53,867 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:41:53" (1/1) ...
[2023-11-19 07:41:53,886 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:41:53" (1/1) ...
[2023-11-19 07:41:53,941 INFO L138 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 258
[2023-11-19 07:41:53,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:41:53,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:41:53,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:41:53,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:41:53,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:53,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:41:54,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:41:54,000 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:41:54,000 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:41:54,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (1/1) ...
[2023-11-19 07:41:54,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:41:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:41:54,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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:41:54,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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:41:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:41:54,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:41:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:41:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:41:54,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume
[2023-11-19 07:41:54,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume
[2023-11-19 07:41:54,174 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:41:54,177 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:41:54,623 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:41:54,645 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:41:54,646 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:41:54,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:54 BoogieIcfgContainer
[2023-11-19 07:41:54,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:41:54,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:41:54,661 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:41:54,665 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:41:54,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:53" (1/3) ...
[2023-11-19 07:41:54,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129b889a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:54, skipping insertion in model container
[2023-11-19 07:41:54,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:53" (2/3) ...
[2023-11-19 07:41:54,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129b889a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:54, skipping insertion in model container
[2023-11-19 07:41:54,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:54" (3/3) ...
[2023-11-19 07:41:54,668 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-010.c
[2023-11-19 07:41:54,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:41:54,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:41:54,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:41:54,752 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;@6577c92b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:41:54,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:41:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128)
[2023-11-19 07:41:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672
[2023-11-19 07:41:54,807 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:41:54,808 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:41:54,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 588204487, now seen corresponding path program 1 times
[2023-11-19 07:41:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002040874]
[2023-11-19 07:41:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:41:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-19 07:41:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-19 07:41:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-19 07:41:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-19 07:41:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2023-11-19 07:41:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-11-19 07:41:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-11-19 07:41:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-11-19 07:41:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-11-19 07:41:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2023-11-19 07:41:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2023-11-19 07:41:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2023-11-19 07:41:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2023-11-19 07:41:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2023-11-19 07:41:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2023-11-19 07:41:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90
[2023-11-19 07:41:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95
[2023-11-19 07:41:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101
[2023-11-19 07:41:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2023-11-19 07:41:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112
[2023-11-19 07:41:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117
[2023-11-19 07:41:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2023-11-19 07:41:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128
[2023-11-19 07:41:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2023-11-19 07:41:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2023-11-19 07:41:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145
[2023-11-19 07:41:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2023-11-19 07:41:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156
[2023-11-19 07:41:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2023-11-19 07:41:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167
[2023-11-19 07:41:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2023-11-19 07:41:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178
[2023-11-19 07:41:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183
[2023-11-19 07:41:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189
[2023-11-19 07:41:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194
[2023-11-19 07:41:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200
[2023-11-19 07:41:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205
[2023-11-19 07:41:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211
[2023-11-19 07:41:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216
[2023-11-19 07:41:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221
[2023-11-19 07:41:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226
[2023-11-19 07:41:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231
[2023-11-19 07:41:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236
[2023-11-19 07:41:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241
[2023-11-19 07:41:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246
[2023-11-19 07:41:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251
[2023-11-19 07:41:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256
[2023-11-19 07:41:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261
[2023-11-19 07:41:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266
[2023-11-19 07:41:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271
[2023-11-19 07:41:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276
[2023-11-19 07:41:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281
[2023-11-19 07:41:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286
[2023-11-19 07:41:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291
[2023-11-19 07:41:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296
[2023-11-19 07:41:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301
[2023-11-19 07:41:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306
[2023-11-19 07:41:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311
[2023-11-19 07:41:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316
[2023-11-19 07:41:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321
[2023-11-19 07:41:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326
[2023-11-19 07:41:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331
[2023-11-19 07:41:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336
[2023-11-19 07:41:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341
[2023-11-19 07:41:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346
[2023-11-19 07:41:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351
[2023-11-19 07:41:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356
[2023-11-19 07:41:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361
[2023-11-19 07:41:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366
[2023-11-19 07:41:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371
[2023-11-19 07:41:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376
[2023-11-19 07:41:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381
[2023-11-19 07:41:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386
[2023-11-19 07:41:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391
[2023-11-19 07:41:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396
[2023-11-19 07:41:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401
[2023-11-19 07:41:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406
[2023-11-19 07:41:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411
[2023-11-19 07:41:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416
[2023-11-19 07:41:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421
[2023-11-19 07:41:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426
[2023-11-19 07:41:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431
[2023-11-19 07:41:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436
[2023-11-19 07:41:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441
[2023-11-19 07:41:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446
[2023-11-19 07:41:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 451
[2023-11-19 07:41:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456
[2023-11-19 07:41:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461
[2023-11-19 07:41:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466
[2023-11-19 07:41:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471
[2023-11-19 07:41:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476
[2023-11-19 07:41:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481
[2023-11-19 07:41:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486
[2023-11-19 07:41:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491
[2023-11-19 07:41:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496
[2023-11-19 07:41:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501
[2023-11-19 07:41:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506
[2023-11-19 07:41:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511
[2023-11-19 07:41:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516
[2023-11-19 07:41:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521
[2023-11-19 07:41:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526
[2023-11-19 07:41:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531
[2023-11-19 07:41:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536
[2023-11-19 07:41:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541
[2023-11-19 07:41:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546
[2023-11-19 07:41:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551
[2023-11-19 07:41:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 556
[2023-11-19 07:41:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 561
[2023-11-19 07:41:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566
[2023-11-19 07:41:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571
[2023-11-19 07:41:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576
[2023-11-19 07:41:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581
[2023-11-19 07:41:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586
[2023-11-19 07:41:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 591
[2023-11-19 07:41:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596
[2023-11-19 07:41:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601
[2023-11-19 07:41:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 606
[2023-11-19 07:41:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611
[2023-11-19 07:41:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617
[2023-11-19 07:41:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623
[2023-11-19 07:41:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629
[2023-11-19 07:41:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635
[2023-11-19 07:41:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 641
[2023-11-19 07:41:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647
[2023-11-19 07:41:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653
[2023-11-19 07:41:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 659
[2023-11-19 07:41:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665
[2023-11-19 07:41:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked.
[2023-11-19 07:41:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002040874]
[2023-11-19 07:41:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002040874] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:41:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427258328]
[2023-11-19 07:41:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:41:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:41:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:41:56,450 INFO L87 Difference]: Start difference. First operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128)
[2023-11-19 07:41:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:41:56,586 INFO L93 Difference]: Finished difference Result 328 states and 710 transitions.
[2023-11-19 07:41:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 07:41:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 671
[2023-11-19 07:41:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:41:56,610 INFO L225 Difference]: With dead ends: 328
[2023-11-19 07:41:56,610 INFO L226 Difference]: Without dead ends: 164
[2023-11-19 07:41:56,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 386 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-19 07:41:56,631 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:41:56,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:41:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2023-11-19 07:41:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164.
[2023-11-19 07:41:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 34 states have (on average 1.0) internal successors, (34), 34 states have internal predecessors, (34), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128)
[2023-11-19 07:41:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 290 transitions.
[2023-11-19 07:41:56,783 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 290 transitions. Word has length 671
[2023-11-19 07:41:56,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:41:56,786 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 290 transitions.
[2023-11-19 07:41:56,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128)
[2023-11-19 07:41:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 290 transitions.
[2023-11-19 07:41:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672
[2023-11-19 07:41:56,822 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:41:56,822 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:41:56,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:41:56,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 354405747, now seen corresponding path program 1 times
[2023-11-19 07:41:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446004976]
[2023-11-19 07:41:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:42:05,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:42:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:42:10,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:42:10,951 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:42:10,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-19 07:42:10,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:42:10,960 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1]
[2023-11-19 07:42:10,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:42:11,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:42:11 BoogieIcfgContainer
[2023-11-19 07:42:11,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:42:11,202 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:42:11,202 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:42:11,202 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:42:11,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:54" (3/4) ...
[2023-11-19 07:42:11,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:42:11,408 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:42:11,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:42:11,409 INFO L158 Benchmark]: Toolchain (without parser) took 17904.03ms. Allocated memory was 146.8MB in the beginning and 868.2MB in the end (delta: 721.4MB). Free memory was 100.6MB in the beginning and 496.0MB in the end (delta: -395.4MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,409 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:42:11,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.05ms. Allocated memory is still 146.8MB. Free memory was 100.6MB in the beginning and 86.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.08ms. Allocated memory is still 146.8MB. Free memory was 86.8MB in the beginning and 84.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,410 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,411 INFO L158 Benchmark]: RCFGBuilder took 652.81ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 82.6MB in the beginning and 166.4MB in the end (delta: -83.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,411 INFO L158 Benchmark]: TraceAbstraction took 16541.75ms. Allocated memory was 207.6MB in the beginning and 868.2MB in the end (delta: 660.6MB). Free memory was 165.2MB in the beginning and 513.8MB in the end (delta: -348.6MB). Peak memory consumption was 378.5MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,412 INFO L158 Benchmark]: Witness Printer took 206.69ms. Allocated memory is still 868.2MB. Free memory was 513.8MB in the beginning and 496.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2023-11-19 07:42:11,415 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.33ms. Allocated memory is still 146.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 351.05ms. Allocated memory is still 146.8MB. Free memory was 100.6MB in the beginning and 86.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 83.08ms. Allocated memory is still 146.8MB. Free memory was 86.8MB in the beginning and 84.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 45.30ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 652.81ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 82.6MB in the beginning and 166.4MB in the end (delta: -83.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 16541.75ms. Allocated memory was 207.6MB in the beginning and 868.2MB in the end (delta: 660.6MB). Free memory was 165.2MB in the beginning and 513.8MB in the end (delta: -348.6MB). Peak memory consumption was 378.5MB. Max. memory is 16.1GB.
* Witness Printer took 206.69ms. Allocated memory is still 868.2MB. Free memory was 513.8MB in the beginning and 496.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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: 213]: 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=2]
[L30] CALL assume(var0 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L30] RET assume(var0 <= 9)
VAL [dummy=0, var0=2]
[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=2, var1=8]
[L34] CALL assume(var1 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L34] RET assume(var1 <= 9)
VAL [dummy=0, var0=2, var1=8]
[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=2, var1=8, var2=4]
[L38] CALL assume(var2 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L38] RET assume(var2 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4]
[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=2, var1=8, var2=4, var3=5]
[L42] CALL assume(var3 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L42] RET assume(var3 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, 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=2, var1=8, var2=4, var3=5, var4=3]
[L46] CALL assume(var4 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L46] RET assume(var4 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3]
[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=2, var1=8, var2=4, var3=5, var4=3, var5=6]
[L50] CALL assume(var5 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L50] RET assume(var5 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6]
[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=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1]
[L54] CALL assume(var6 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L54] RET assume(var6 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1]
[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=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9]
[L58] CALL assume(var7 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L58] RET assume(var7 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9]
[L59] int var8;
[L60] var8 = __VERIFIER_nondet_int()
[L61] CALL assume(var8 >= 0)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L61] RET assume(var8 >= 0)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0]
[L62] CALL assume(var8 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L62] RET assume(var8 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0]
[L63] int var9;
[L64] var9 = __VERIFIER_nondet_int()
[L65] CALL assume(var9 >= 0)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L65] RET assume(var9 >= 0)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L66] CALL assume(var9 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L66] RET assume(var9 <= 9)
VAL [dummy=0, var0=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[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=2, var10=6, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L70] CALL assume(var10 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L70] RET assume(var10 <= 9)
VAL [dummy=0, var0=2, var10=6, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[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=2, var10=6, var11=4, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L74] CALL assume(var11 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L74] RET assume(var11 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[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=2, var10=6, var11=4, var12=1, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L78] CALL assume(var12 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L78] RET assume(var12 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[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=2, var10=6, var11=4, var12=1, var13=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L82] CALL assume(var13 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L82] RET assume(var13 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[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=2, var10=6, var11=4, var12=1, var13=2, var14=3, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L86] CALL assume(var14 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L86] RET assume(var14 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L87] int var15;
[L88] var15 = __VERIFIER_nondet_int()
[L89] CALL assume(var15 >= 1)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L89] RET assume(var15 >= 1)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L90] CALL assume(var15 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L90] RET assume(var15 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L91] int var16;
[L92] var16 = __VERIFIER_nondet_int()
[L93] CALL assume(var16 >= 1)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L93] RET assume(var16 >= 1)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L94] CALL assume(var16 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L94] RET assume(var16 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L95] int var17;
[L96] var17 = __VERIFIER_nondet_int()
[L97] CALL assume(var17 >= 1)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L97] RET assume(var17 >= 1)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L98] CALL assume(var17 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L98] RET assume(var17 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L99] int var18;
[L100] var18 = __VERIFIER_nondet_int()
[L101] CALL assume(var18 >= 1)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L101] RET assume(var18 >= 1)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L102] CALL assume(var18 <= 9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L102] RET assume(var18 <= 9)
VAL [dummy=0, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L103] int myvar0 = 1;
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L104] CALL assume(var0 != var1)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L104] RET assume(var0 != var1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L105] CALL assume(var0 != var2)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L105] RET assume(var0 != var2)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L106] CALL assume(var0 != var3)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L106] RET assume(var0 != var3)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L107] CALL assume(var0 != var4)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L107] RET assume(var0 != var4)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L108] CALL assume(var0 != var5)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L108] RET assume(var0 != var5)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L109] CALL assume(var0 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L109] RET assume(var0 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L110] CALL assume(var0 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L110] RET assume(var0 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L111] CALL assume(var0 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L111] RET assume(var0 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L112] CALL assume(var0 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L112] RET assume(var0 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L113] CALL assume(var1 != var2)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L113] RET assume(var1 != var2)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L114] CALL assume(var1 != var3)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L114] RET assume(var1 != var3)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L115] CALL assume(var1 != var4)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L115] RET assume(var1 != var4)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L116] CALL assume(var1 != var5)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L116] RET assume(var1 != var5)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L117] CALL assume(var1 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L117] RET assume(var1 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L118] CALL assume(var1 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L118] RET assume(var1 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L119] CALL assume(var1 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L119] RET assume(var1 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L120] CALL assume(var1 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L120] RET assume(var1 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L121] CALL assume(var2 != var3)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L121] RET assume(var2 != var3)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L122] CALL assume(var2 != var4)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L122] RET assume(var2 != var4)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L123] CALL assume(var2 != var5)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L123] RET assume(var2 != var5)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L124] CALL assume(var2 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L124] RET assume(var2 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L125] CALL assume(var2 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L125] RET assume(var2 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L126] CALL assume(var2 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L126] RET assume(var2 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L127] CALL assume(var2 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L127] RET assume(var2 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L128] CALL assume(var3 != var4)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L128] RET assume(var3 != var4)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L129] CALL assume(var3 != var5)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L129] RET assume(var3 != var5)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L130] CALL assume(var3 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L130] RET assume(var3 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L131] CALL assume(var3 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L131] RET assume(var3 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L132] CALL assume(var3 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L132] RET assume(var3 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L133] CALL assume(var3 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L133] RET assume(var3 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L134] CALL assume(var4 != var5)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L134] RET assume(var4 != var5)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L135] CALL assume(var4 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L135] RET assume(var4 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L136] CALL assume(var4 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L136] RET assume(var4 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L137] CALL assume(var4 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L137] RET assume(var4 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L138] CALL assume(var4 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L138] RET assume(var4 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L139] CALL assume(var5 != var6)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L139] RET assume(var5 != var6)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L140] CALL assume(var5 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L140] RET assume(var5 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L141] CALL assume(var5 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L141] RET assume(var5 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L142] CALL assume(var5 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L142] RET assume(var5 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L143] CALL assume(var6 != var7)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L143] RET assume(var6 != var7)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L144] CALL assume(var6 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L144] RET assume(var6 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L145] CALL assume(var6 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L145] RET assume(var6 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L146] CALL assume(var7 != var8)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L146] RET assume(var7 != var8)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L147] CALL assume(var7 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L147] RET assume(var7 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L148] CALL assume(var8 != var9)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L148] RET assume(var8 != var9)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L149] CALL assume(var10 != var11)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L149] RET assume(var10 != var11)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L150] CALL assume(var10 != var12)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L150] RET assume(var10 != var12)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L151] CALL assume(var10 != var13)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L151] RET assume(var10 != var13)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L152] CALL assume(var10 != var14)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L152] RET assume(var10 != var14)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L153] CALL assume(var10 != var15)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L153] RET assume(var10 != var15)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L154] CALL assume(var10 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L154] RET assume(var10 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L155] CALL assume(var10 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L155] RET assume(var10 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L156] CALL assume(var10 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L156] RET assume(var10 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L157] CALL assume(var11 != var12)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L157] RET assume(var11 != var12)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L158] CALL assume(var11 != var13)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L158] RET assume(var11 != var13)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L159] CALL assume(var11 != var14)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L159] RET assume(var11 != var14)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L160] CALL assume(var11 != var15)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L160] RET assume(var11 != var15)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L161] CALL assume(var11 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L161] RET assume(var11 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L162] CALL assume(var11 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L162] RET assume(var11 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L163] CALL assume(var11 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L163] RET assume(var11 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L164] CALL assume(var12 != var13)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L164] RET assume(var12 != var13)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L165] CALL assume(var12 != var14)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L165] RET assume(var12 != var14)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L166] CALL assume(var12 != var15)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L166] RET assume(var12 != var15)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L167] CALL assume(var12 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L167] RET assume(var12 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L168] CALL assume(var12 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L168] RET assume(var12 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L169] CALL assume(var12 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L169] RET assume(var12 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L170] CALL assume(var13 != var14)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L170] RET assume(var13 != var14)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L171] CALL assume(var13 != var15)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L171] RET assume(var13 != var15)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L172] CALL assume(var13 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L172] RET assume(var13 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L173] CALL assume(var13 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L173] RET assume(var13 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L174] CALL assume(var13 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L174] RET assume(var13 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L175] CALL assume(var14 != var15)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L175] RET assume(var14 != var15)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L176] CALL assume(var14 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L176] RET assume(var14 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L177] CALL assume(var14 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L177] RET assume(var14 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L178] CALL assume(var14 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L178] RET assume(var14 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L179] CALL assume(var15 != var16)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L179] RET assume(var15 != var16)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L180] CALL assume(var15 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L180] RET assume(var15 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L181] CALL assume(var15 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L181] RET assume(var15 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L182] CALL assume(var16 != var17)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L182] RET assume(var16 != var17)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L183] CALL assume(var16 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L183] RET assume(var16 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L184] CALL assume(var17 != var18)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L184] RET assume(var17 != var18)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7]
[L185] int var_for_abs;
[L186] var_for_abs = var0 - var1
[L187] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=6]
[L188] CALL assume(var10 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L188] RET assume(var10 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=6]
[L189] var_for_abs = var1 - var2
[L190] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=4]
[L191] CALL assume(var11 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L191] RET assume(var11 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=4]
[L192] var_for_abs = var2 - var3
[L193] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=1]
[L194] CALL assume(var12 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L194] RET assume(var12 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=1]
[L195] var_for_abs = var3 - var4
[L196] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=2]
[L197] CALL assume(var13 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L197] RET assume(var13 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=2]
[L198] var_for_abs = var4 - var5
[L199] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=3]
[L200] CALL assume(var14 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L200] RET assume(var14 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=3]
[L201] var_for_abs = var5 - var6
[L202] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=5]
[L203] CALL assume(var15 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L203] RET assume(var15 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=5]
[L204] var_for_abs = var6 - var7
[L205] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=8]
[L206] CALL assume(var16 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L206] RET assume(var16 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=8]
[L207] var_for_abs = var7 - var8
[L208] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=9]
[L209] CALL assume(var17 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L209] RET assume(var17 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=9]
[L210] var_for_abs = var8 - var9
[L211] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=7]
[L212] CALL assume(var18 == var_for_abs)
VAL [\old(cond)=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1]
[L212] RET assume(var18 == var_for_abs)
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=7]
[L213] reach_error()
VAL [dummy=0, myvar0=1, var0=2, var10=6, var11=4, var12=1, var13=2, var14=3, var15=5, var16=8, var17=9, var18=7, var1=8, var2=4, var3=5, var4=3, var5=6, var6=1, var7=9, var8=0, var9=7, var_for_abs=7]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 2, TraceHistogramMax: 128, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 290 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred 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.1s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 670 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 32512/32512 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:42:11,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfdcae-d42a-41f8-86a5-e094926a6d40/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