./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-011.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-011.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:29:00,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:29:00,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:29:00,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:29:00,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:29:00,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:29:00,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:29:00,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:29:00,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:29:00,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:29:00,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:29:00,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:29:00,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:29:00,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:29:00,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:29:00,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:29:00,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:29:00,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:29:00,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:29:00,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:29:00,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:29:00,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:29:00,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:29:00,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:29:00,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:29:00,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:29:00,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:29:00,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:29:00,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:29:00,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:29:00,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:29:00,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:29:00,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:29:00,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:29:00,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:29:00,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:29:00,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:29:00,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:29:00,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:29:00,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:29:00,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:29:00,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:29:00,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:29:00,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:29:00,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:29:00,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:29:00,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:29:00,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:29:00,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:29:00,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:29:00,762 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:29:00,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:29:00,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:29:00,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:29:00,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:29:00,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:29:00,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:29:00,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:29:00,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:29:00,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:29:00,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:29:00,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:29:00,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:29:00,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:29:00,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:29:00,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:29:00,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:00,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:29:00,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:29:00,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:29:00,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:29:00,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:29:00,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:29:00,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:29:00,770 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:29:00,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:29:00,770 INFO L138 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_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/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_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf [2022-11-25 18:29:01,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:29:01,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:29:01,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:29:01,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:29:01,166 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:29:01,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/xcsp/AllInterval-011.c [2022-11-25 18:29:04,331 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:29:04,629 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:29:04,630 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/sv-benchmarks/c/xcsp/AllInterval-011.c [2022-11-25 18:29:04,640 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/data/8f11e0900/3451c907d06847fa95d91987b32b5e10/FLAG2de7b8cc7 [2022-11-25 18:29:04,666 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/data/8f11e0900/3451c907d06847fa95d91987b32b5e10 [2022-11-25 18:29:04,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:29:04,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:29:04,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:04,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:29:04,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:29:04,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:04" (1/1) ... [2022-11-25 18:29:04,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c23dc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:04, skipping insertion in model container [2022-11-25 18:29:04,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:04" (1/1) ... [2022-11-25 18:29:04,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:29:04,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:29:04,956 WARN L237 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_560570cf-7d57-4a26-ae54-8f01efaa2cc5/sv-benchmarks/c/xcsp/AllInterval-011.c[6600,6613] [2022-11-25 18:29:04,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:04,974 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:29:05,022 WARN L237 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_560570cf-7d57-4a26-ae54-8f01efaa2cc5/sv-benchmarks/c/xcsp/AllInterval-011.c[6600,6613] [2022-11-25 18:29:05,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:05,039 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:29:05,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05 WrapperNode [2022-11-25 18:29:05,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:05,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:05,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:29:05,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:29:05,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,096 INFO L138 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 274 [2022-11-25 18:29:05,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:05,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:29:05,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:29:05,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:29:05,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:29:05,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:29:05,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:29:05,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:29:05,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (1/1) ... [2022-11-25 18:29:05,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:05,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:29:05,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:29:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:29:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:29:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:29:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:29:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-11-25 18:29:05,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-11-25 18:29:05,399 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:29:05,402 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:29:05,914 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:29:05,923 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:29:05,924 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:29:05,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:05 BoogieIcfgContainer [2022-11-25 18:29:05,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:29:05,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:29:05,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:29:05,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:29:05,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:29:04" (1/3) ... [2022-11-25 18:29:05,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74802cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:05, skipping insertion in model container [2022-11-25 18:29:05,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:05" (2/3) ... [2022-11-25 18:29:05,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74802cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:05, skipping insertion in model container [2022-11-25 18:29:05,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:05" (3/3) ... [2022-11-25 18:29:05,938 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-011.c [2022-11-25 18:29:05,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:29:05,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:29:06,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:29:06,111 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=LoopsAndPotentialCycles, 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;@77524ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:29:06,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:29:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2022-11-25 18:29:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2022-11-25 18:29:06,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:06,196 INFO L195 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:06,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash -696530000, now seen corresponding path program 1 times [2022-11-25 18:29:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:06,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617400440] [2022-11-25 18:29:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:29:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:29:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:29:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:29:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:29:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:29:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:29:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:29:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:29:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:29:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 18:29:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 18:29:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:29:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 18:29:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:29:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 18:29:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-25 18:29:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 18:29:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 18:29:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:29:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 18:29:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:29:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:29:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 18:29:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-25 18:29:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 18:29:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 18:29:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-25 18:29:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-25 18:29:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 18:29:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 18:29:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 18:29:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-25 18:29:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-25 18:29:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 18:29:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 18:29:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-25 18:29:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-25 18:29:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 18:29:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-25 18:29:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-25 18:29:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 18:29:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 18:29:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 18:29:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-25 18:29:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 18:29:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-25 18:29:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 18:29:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 18:29:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 18:29:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 18:29:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-11-25 18:29:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-25 18:29:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-11-25 18:29:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-11-25 18:29:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2022-11-25 18:29:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-25 18:29:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-11-25 18:29:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-25 18:29:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-25 18:29:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 18:29:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 18:29:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-11-25 18:29:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-25 18:29:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-25 18:29:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-11-25 18:29:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-11-25 18:29:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-11-25 18:29:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-11-25 18:29:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-11-25 18:29:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-11-25 18:29:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-11-25 18:29:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2022-11-25 18:29:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-11-25 18:29:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2022-11-25 18:29:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2022-11-25 18:29:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-11-25 18:29:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-11-25 18:29:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2022-11-25 18:29:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 423 [2022-11-25 18:29:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-11-25 18:29:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-11-25 18:29:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2022-11-25 18:29:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-25 18:29:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-11-25 18:29:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-11-25 18:29:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2022-11-25 18:29:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2022-11-25 18:29:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 468 [2022-11-25 18:29:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2022-11-25 18:29:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-11-25 18:29:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2022-11-25 18:29:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2022-11-25 18:29:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2022-11-25 18:29:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2022-11-25 18:29:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-11-25 18:29:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2022-11-25 18:29:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2022-11-25 18:29:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2022-11-25 18:29:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2022-11-25 18:29:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2022-11-25 18:29:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2022-11-25 18:29:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2022-11-25 18:29:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2022-11-25 18:29:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-11-25 18:29:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 553 [2022-11-25 18:29:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 558 [2022-11-25 18:29:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2022-11-25 18:29:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2022-11-25 18:29:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2022-11-25 18:29:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 578 [2022-11-25 18:29:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2022-11-25 18:29:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2022-11-25 18:29:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2022-11-25 18:29:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2022-11-25 18:29:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2022-11-25 18:29:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 608 [2022-11-25 18:29:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 613 [2022-11-25 18:29:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2022-11-25 18:29:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2022-11-25 18:29:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2022-11-25 18:29:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2022-11-25 18:29:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2022-11-25 18:29:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 643 [2022-11-25 18:29:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 648 [2022-11-25 18:29:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2022-11-25 18:29:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2022-11-25 18:29:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2022-11-25 18:29:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 668 [2022-11-25 18:29:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 673 [2022-11-25 18:29:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2022-11-25 18:29:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2022-11-25 18:29:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2022-11-25 18:29:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 693 [2022-11-25 18:29:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 698 [2022-11-25 18:29:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2022-11-25 18:29:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2022-11-25 18:29:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2022-11-25 18:29:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2022-11-25 18:29:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2022-11-25 18:29:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2022-11-25 18:29:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2022-11-25 18:29:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 740 [2022-11-25 18:29:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 746 [2022-11-25 18:29:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 752 [2022-11-25 18:29:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 758 [2022-11-25 18:29:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2022-11-25 18:29:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 770 [2022-11-25 18:29:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 776 [2022-11-25 18:29:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 782 [2022-11-25 18:29:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2022-11-25 18:29:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45904 trivial. 0 not checked. [2022-11-25 18:29:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:07,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617400440] [2022-11-25 18:29:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617400440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:07,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162228600] [2022-11-25 18:29:07,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:07,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:29:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:29:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:29:07,773 INFO L87 Difference]: Start difference. First operand has 194 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2022-11-25 18:29:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:07,900 INFO L93 Difference]: Finished difference Result 382 states and 836 transitions. [2022-11-25 18:29:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:29:07,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) Word has length 794 [2022-11-25 18:29:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:07,920 INFO L225 Difference]: With dead ends: 382 [2022-11-25 18:29:07,920 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 18:29:07,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:29:07,937 INFO L413 NwaCegarLoop]: 341 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, 341 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 [2022-11-25 18:29:07,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:29:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 18:29:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-25 18:29:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 37 states have (on average 1.0) internal successors, (37), 37 states have internal predecessors, (37), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2022-11-25 18:29:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 341 transitions. [2022-11-25 18:29:08,126 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 341 transitions. Word has length 794 [2022-11-25 18:29:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:08,129 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 341 transitions. [2022-11-25 18:29:08,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2022-11-25 18:29:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 341 transitions. [2022-11-25 18:29:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2022-11-25 18:29:08,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:08,171 INFO L195 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:29:08,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1894498652, now seen corresponding path program 1 times [2022-11-25 18:29:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:08,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259750189] [2022-11-25 18:29:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:29:26,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:29:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:29:34,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:29:34,138 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:29:34,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:29:34,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:29:34,151 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 18:29:34,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:29:34,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:29:34 BoogieIcfgContainer [2022-11-25 18:29:34,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:29:34,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:29:34,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:29:34,409 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:29:34,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:05" (3/4) ... [2022-11-25 18:29:34,411 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:29:34,609 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:29:34,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:29:34,610 INFO L158 Benchmark]: Toolchain (without parser) took 29937.71ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 966.8MB). Free memory was 120.4MB in the beginning and 604.1MB in the end (delta: -483.8MB). Peak memory consumption was 481.6MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,610 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:29:34,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.91ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 106.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.06ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,611 INFO L158 Benchmark]: Boogie Preprocessor took 67.63ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,611 INFO L158 Benchmark]: RCFGBuilder took 761.54ms. Allocated memory is still 151.0MB. Free memory was 101.6MB in the beginning and 78.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,612 INFO L158 Benchmark]: TraceAbstraction took 28478.39ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 966.8MB). Free memory was 77.9MB in the beginning and 631.4MB in the end (delta: -553.5MB). Peak memory consumption was 643.1MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,612 INFO L158 Benchmark]: Witness Printer took 200.69ms. Allocated memory is still 1.1GB. Free memory was 631.4MB in the beginning and 604.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:29:34,614 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.91ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 106.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.06ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.63ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 761.54ms. Allocated memory is still 151.0MB. Free memory was 101.6MB in the beginning and 78.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28478.39ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 966.8MB). Free memory was 77.9MB in the beginning and 631.4MB in the end (delta: -553.5MB). Peak memory consumption was 643.1MB. Max. memory is 16.1GB. * Witness Printer took 200.69ms. Allocated memory is still 1.1GB. Free memory was 631.4MB in the beginning and 604.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 243]: 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 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 10) 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=7] [L34] CALL assume(var1 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 10) VAL [dummy=0, var0=2, var1=7] [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=7, var2=3] [L38] CALL assume(var2 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3] [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=7, var2=3, var3=6] [L42] CALL assume(var3 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6] [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=7, var2=3, var3=6, var4=8] [L46] CALL assume(var4 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8] [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=7, var2=3, var3=6, var4=8, var5=1] [L50] CALL assume(var5 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1, var6=9] [L54] CALL assume(var6 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1, var6=9] [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=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0] [L58] CALL assume(var7 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0] [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=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10] [L62] CALL assume(var8 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10] [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=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L66] CALL assume(var9 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 10) VAL [dummy=0, var0=2, var1=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 0) VAL [dummy=0, var0=2, var1=7, var10=5, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L70] CALL assume(var10 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L74] CALL assume(var11 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L78] CALL assume(var12 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L82] CALL assume(var13 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L86] CALL assume(var14 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L90] CALL assume(var15 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var15 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L94] CALL assume(var16 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var16 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L98] CALL assume(var17 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var17 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [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, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L102] CALL assume(var18 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var18 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L103] int var19; [L104] var19 = __VERIFIER_nondet_int() [L105] CALL assume(var19 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var19 >= 1) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L106] CALL assume(var19 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var19 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L107] int var20; [L108] var20 = __VERIFIER_nondet_int() [L109] CALL assume(var20 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var20 >= 1) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L110] CALL assume(var20 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var20 <= 10) VAL [dummy=0, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L111] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L112] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L113] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L114] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L115] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L116] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L117] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L118] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L119] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var0 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L120] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var0 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L121] CALL assume(var0 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var0 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L122] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L123] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L124] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L125] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L126] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L127] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L128] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var1 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L129] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var1 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L130] CALL assume(var1 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var1 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L131] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L132] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L133] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L134] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L135] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L136] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var2 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L137] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L137] RET assume(var2 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L138] CALL assume(var2 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L138] RET assume(var2 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L139] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L140] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L141] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L141] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L142] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L142] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L143] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var3 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L144] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var3 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L145] CALL assume(var3 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L145] RET assume(var3 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L146] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L147] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L148] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L149] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var4 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L150] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L150] RET assume(var4 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L151] CALL assume(var4 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var4 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L152] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L153] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L153] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L154] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L154] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L155] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var5 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L156] CALL assume(var5 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var5 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L157] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L157] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L158] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L159] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L160] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var6 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L161] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L161] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L162] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L162] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L163] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L164] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L165] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L165] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L166] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L166] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L167] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L168] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L169] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L169] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L170] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L170] RET assume(var11 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L171] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var11 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L172] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var11 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L173] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L173] RET assume(var11 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L174] CALL assume(var11 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L174] RET assume(var11 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L175] CALL assume(var11 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var11 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L176] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L177] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L177] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L178] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L178] RET assume(var12 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L179] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var12 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L180] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var12 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L181] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L181] RET assume(var12 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L182] CALL assume(var12 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L182] RET assume(var12 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L183] CALL assume(var12 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var12 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L184] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L185] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L185] RET assume(var13 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L186] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L186] RET assume(var13 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L187] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var13 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L188] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var13 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L189] CALL assume(var13 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L189] RET assume(var13 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L190] CALL assume(var13 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L190] RET assume(var13 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L191] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var14 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L192] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var14 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L193] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L193] RET assume(var14 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L194] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L194] RET assume(var14 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L195] CALL assume(var14 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var14 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L196] CALL assume(var14 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var14 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L197] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L197] RET assume(var15 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L198] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L198] RET assume(var15 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L199] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var15 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L200] CALL assume(var15 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var15 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L201] CALL assume(var15 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L201] RET assume(var15 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L202] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L202] RET assume(var16 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L203] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var16 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L204] CALL assume(var16 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var16 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L205] CALL assume(var16 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L205] RET assume(var16 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L206] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L206] RET assume(var17 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L207] CALL assume(var17 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var17 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L208] CALL assume(var17 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var17 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L209] CALL assume(var18 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L209] RET assume(var18 != var19) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L210] CALL assume(var18 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L210] RET assume(var18 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L211] CALL assume(var19 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var19 != var20) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4] [L212] int var_for_abs; [L213] var_for_abs = var0 - var1 [L214] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=5] [L215] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=5] [L216] var_for_abs = var1 - var2 [L217] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=4] [L218] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L218] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=4] [L219] var_for_abs = var2 - var3 [L220] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=3] [L221] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L221] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=3] [L222] var_for_abs = var3 - var4 [L223] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=2] [L224] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=2] [L225] var_for_abs = var4 - var5 [L226] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=7] [L227] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var15 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=7] [L228] var_for_abs = var5 - var6 [L229] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=8] [L230] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L230] RET assume(var16 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=8] [L231] var_for_abs = var6 - var7 [L232] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=9] [L233] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L233] RET assume(var17 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=9] [L234] var_for_abs = var7 - var8 [L235] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=10] [L236] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L236] RET assume(var18 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=10] [L237] var_for_abs = var8 - var9 [L238] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=6] [L239] CALL assume(var19 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L239] RET assume(var19 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=6] [L240] var_for_abs = var9 - var10 [L241] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=1] [L242] CALL assume(var20 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L242] RET assume(var20 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=1] [L243] reach_error() VAL [dummy=0, myvar0=1, var0=2, var1=7, var10=5, var11=5, var12=4, var13=3, var14=2, var15=7, var16=8, var17=9, var18=10, var19=6, var2=3, var20=1, var3=6, var4=8, var5=1, var6=9, var7=0, var8=10, var9=4, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 194 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 2, TraceHistogramMax: 152, 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, 341 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, 341 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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.2s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 18.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 45904/45904 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! [2022-11-25 18:29:34,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560570cf-7d57-4a26-ae54-8f01efaa2cc5/bin/uautomizer-ZsLfNo2U6R/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