/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 06:49:19,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 06:49:19,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 06:49:19,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 06:49:19,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 06:49:19,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 06:49:19,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 06:49:19,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 06:49:19,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 06:49:19,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 06:49:19,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 06:49:19,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 06:49:19,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 06:49:19,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 06:49:19,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 06:49:19,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 06:49:19,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 06:49:19,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 06:49:19,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 06:49:19,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 06:49:19,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 06:49:19,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 06:49:19,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 06:49:19,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 06:49:19,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 06:49:19,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 06:49:19,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 06:49:19,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 06:49:19,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 06:49:19,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 06:49:19,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 06:49:19,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 06:49:19,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 06:49:19,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 06:49:19,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 06:49:19,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 06:49:19,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 06:49:19,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 06:49:19,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 06:49:19,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 06:49:19,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 06:49:19,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 06:49:19,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 06:49:19,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 06:49:19,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 06:49:19,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 06:49:19,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 06:49:19,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 06:49:19,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 06:49:19,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 06:49:19,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 06:49:19,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:49:19,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 06:49:19,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 06:49:19,112 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 06:49:19,112 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 06:49:19,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 06:49:19,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 06:49:19,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 06:49:19,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 06:49:19,319 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 06:49:19,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-05 06:49:19,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd9503c/58e6624fff49433091a6c4275269164f/FLAG238a12964 [2022-04-05 06:49:19,702 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 06:49:19,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-05 06:49:19,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd9503c/58e6624fff49433091a6c4275269164f/FLAG238a12964 [2022-04-05 06:49:19,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd9503c/58e6624fff49433091a6c4275269164f [2022-04-05 06:49:19,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 06:49:19,725 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 06:49:19,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 06:49:19,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 06:49:19,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 06:49:19,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0cdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19, skipping insertion in model container [2022-04-05 06:49:19,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 06:49:19,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 06:49:19,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-04-05 06:49:19,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:49:19,904 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 06:49:19,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-04-05 06:49:19,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:49:19,945 INFO L208 MainTranslator]: Completed translation [2022-04-05 06:49:19,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19 WrapperNode [2022-04-05 06:49:19,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 06:49:19,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 06:49:19,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 06:49:19,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 06:49:19,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 06:49:19,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 06:49:19,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 06:49:19,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 06:49:19,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (1/1) ... [2022-04-05 06:49:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:49:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:20,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 06:49:20,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 06:49:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 06:49:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 06:49:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 06:49:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 06:49:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 06:49:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 06:49:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 06:49:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 06:49:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 06:49:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 06:49:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-05 06:49:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 06:49:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 06:49:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 06:49:20,099 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 06:49:20,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 06:49:20,247 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 06:49:20,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 06:49:20,267 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 06:49:20,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:49:20 BoogieIcfgContainer [2022-04-05 06:49:20,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 06:49:20,269 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 06:49:20,269 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 06:49:20,270 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 06:49:20,272 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:49:20" (1/1) ... [2022-04-05 06:49:20,273 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 06:49:20,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:49:20 BasicIcfg [2022-04-05 06:49:20,289 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 06:49:20,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 06:49:20,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 06:49:20,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 06:49:20,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:49:19" (1/4) ... [2022-04-05 06:49:20,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4668b3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:49:20, skipping insertion in model container [2022-04-05 06:49:20,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:49:19" (2/4) ... [2022-04-05 06:49:20,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4668b3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:49:20, skipping insertion in model container [2022-04-05 06:49:20,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:49:20" (3/4) ... [2022-04-05 06:49:20,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4668b3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:49:20, skipping insertion in model container [2022-04-05 06:49:20,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:49:20" (4/4) ... [2022-04-05 06:49:20,294 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.cqvasr [2022-04-05 06:49:20,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 06:49:20,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 06:49:20,359 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 06:49:20,365 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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 [2022-04-05 06:49:20,366 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 06:49:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-05 06:49:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 06:49:20,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:20,394 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:20,395 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-05 06:49:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145969699] [2022-04-05 06:49:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:49:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:49:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145969699] [2022-04-05 06:49:20,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145969699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:20,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:20,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 06:49:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071837651] [2022-04-05 06:49:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:20,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 06:49:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 06:49:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 06:49:20,585 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:20,677 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-05 06:49:20,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 06:49:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-05 06:49:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:20,686 INFO L225 Difference]: With dead ends: 57 [2022-04-05 06:49:20,686 INFO L226 Difference]: Without dead ends: 27 [2022-04-05 06:49:20,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 06:49:20,691 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:20,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-05 06:49:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-05 06:49:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 06:49:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-05 06:49:20,725 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-05 06:49:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:20,726 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-05 06:49:20,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-05 06:49:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 06:49:20,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:20,727 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:20,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 06:49:20,727 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-05 06:49:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:20,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223271778] [2022-04-05 06:49:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:49:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:49:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:20,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223271778] [2022-04-05 06:49:20,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223271778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:20,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:20,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:49:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183405063] [2022-04-05 06:49:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:20,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 06:49:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 06:49:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:49:20,838 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:20,909 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-05 06:49:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 06:49:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-05 06:49:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:20,910 INFO L225 Difference]: With dead ends: 40 [2022-04-05 06:49:20,910 INFO L226 Difference]: Without dead ends: 28 [2022-04-05 06:49:20,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:49:20,912 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:20,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-05 06:49:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-05 06:49:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 06:49:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-05 06:49:20,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-05 06:49:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:20,917 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-05 06:49:20,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-05 06:49:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 06:49:20,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:20,918 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:20,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 06:49:20,918 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-05 06:49:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:20,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203476785] [2022-04-05 06:49:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:49:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:49:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203476785] [2022-04-05 06:49:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203476785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:20,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 06:49:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780523993] [2022-04-05 06:49:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:20,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 06:49:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 06:49:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:49:20,980 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:21,092 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-05 06:49:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 06:49:21,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-05 06:49:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:21,093 INFO L225 Difference]: With dead ends: 34 [2022-04-05 06:49:21,093 INFO L226 Difference]: Without dead ends: 32 [2022-04-05 06:49:21,094 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 06:49:21,094 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:21,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-05 06:49:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-05 06:49:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-05 06:49:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-05 06:49:21,102 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-05 06:49:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:21,103 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-05 06:49:21,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 06:49:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-05 06:49:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 06:49:21,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:21,104 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:21,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 06:49:21,104 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-05 06:49:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:21,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406359249] [2022-04-05 06:49:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:21,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344408421] [2022-04-05 06:49:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:21,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:21,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:21,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 06:49:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:21,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 06:49:21,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:49:21,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:49:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406359249] [2022-04-05 06:49:21,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344408421] [2022-04-05 06:49:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344408421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:21,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:21,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 06:49:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014588163] [2022-04-05 06:49:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:21,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 06:49:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 06:49:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:49:21,270 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:49:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:21,335 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-05 06:49:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 06:49:21,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-05 06:49:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:21,337 INFO L225 Difference]: With dead ends: 50 [2022-04-05 06:49:21,337 INFO L226 Difference]: Without dead ends: 48 [2022-04-05 06:49:21,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:49:21,338 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:21,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-05 06:49:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-05 06:49:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-05 06:49:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-05 06:49:21,347 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-05 06:49:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:21,347 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-05 06:49:21,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:49:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-05 06:49:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 06:49:21,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:21,348 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:21,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:21,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:21,556 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-05 06:49:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:21,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808910647] [2022-04-05 06:49:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:21,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777963619] [2022-04-05 06:49:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:21,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:21,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 06:49:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:21,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 06:49:21,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 06:49:21,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:49:21,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:21,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808910647] [2022-04-05 06:49:21,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:21,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777963619] [2022-04-05 06:49:21,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777963619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:21,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:21,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 06:49:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784783757] [2022-04-05 06:49:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:21,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 06:49:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 06:49:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:49:21,711 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:49:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:21,755 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-05 06:49:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 06:49:21,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-05 06:49:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:21,757 INFO L225 Difference]: With dead ends: 54 [2022-04-05 06:49:21,757 INFO L226 Difference]: Without dead ends: 52 [2022-04-05 06:49:21,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:49:21,759 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:21,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:49:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-05 06:49:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-05 06:49:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-05 06:49:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-05 06:49:21,773 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-05 06:49:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:21,773 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-05 06:49:21,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:49:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-05 06:49:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-05 06:49:21,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:21,774 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:21,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 06:49:21,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:21,989 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-05 06:49:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378959683] [2022-04-05 06:49:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:21,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:21,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802704289] [2022-04-05 06:49:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:21,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:22,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 06:49:22,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 06:49:22,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-05 06:49:22,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:49:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378959683] [2022-04-05 06:49:22,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802704289] [2022-04-05 06:49:22,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802704289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:49:22,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:49:22,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 06:49:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946372705] [2022-04-05 06:49:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:49:22,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 06:49:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 06:49:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:49:22,129 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 06:49:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:22,197 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-05 06:49:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 06:49:22,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-05 06:49:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:22,198 INFO L225 Difference]: With dead ends: 62 [2022-04-05 06:49:22,198 INFO L226 Difference]: Without dead ends: 50 [2022-04-05 06:49:22,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:49:22,200 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:22,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-05 06:49:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-05 06:49:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 06:49:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-05 06:49:22,213 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-05 06:49:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:22,213 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-05 06:49:22,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 06:49:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-05 06:49:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 06:49:22,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:22,214 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 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-04-05 06:49:22,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:22,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:22,428 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-05 06:49:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:22,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225402383] [2022-04-05 06:49:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:22,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:22,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680921643] [2022-04-05 06:49:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:22,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 06:49:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:22,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 06:49:22,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 06:49:22,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 06:49:22,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225402383] [2022-04-05 06:49:22,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680921643] [2022-04-05 06:49:22,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680921643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:22,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:22,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-05 06:49:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161266450] [2022-04-05 06:49:22,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:22,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:49:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:49:22,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:49:22,640 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-05 06:49:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:22,754 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-05 06:49:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 06:49:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-05 06:49:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:22,756 INFO L225 Difference]: With dead ends: 120 [2022-04-05 06:49:22,756 INFO L226 Difference]: Without dead ends: 104 [2022-04-05 06:49:22,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-05 06:49:22,757 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:22,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-05 06:49:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-05 06:49:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 06:49:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-05 06:49:22,765 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-05 06:49:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:22,766 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-05 06:49:22,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-05 06:49:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-05 06:49:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 06:49:22,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:22,767 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:22,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-05 06:49:22,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:22,967 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-04-05 06:49:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:22,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881287519] [2022-04-05 06:49:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:22,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009954442] [2022-04-05 06:49:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:22,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:23,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 06:49:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:23,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 06:49:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 06:49:23,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-05 06:49:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:23,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881287519] [2022-04-05 06:49:23,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:23,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009954442] [2022-04-05 06:49:23,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009954442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:23,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:23,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 06:49:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871829811] [2022-04-05 06:49:23,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:23,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:49:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:49:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:49:23,224 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 06:49:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:23,510 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-05 06:49:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:49:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-05 06:49:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:23,511 INFO L225 Difference]: With dead ends: 118 [2022-04-05 06:49:23,511 INFO L226 Difference]: Without dead ends: 116 [2022-04-05 06:49:23,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-05 06:49:23,512 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:23,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:49:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-05 06:49:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-05 06:49:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 06:49:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-05 06:49:23,526 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-05 06:49:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:23,527 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-05 06:49:23,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 06:49:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-05 06:49:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 06:49:23,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:23,528 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:23,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:23,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:23,738 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-04-05 06:49:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:23,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573403809] [2022-04-05 06:49:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:23,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:23,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263500240] [2022-04-05 06:49:23,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:49:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:23,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:23,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 06:49:23,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:49:23,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:23,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 06:49:23,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 06:49:23,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-05 06:49:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:24,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573403809] [2022-04-05 06:49:24,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:24,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263500240] [2022-04-05 06:49:24,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263500240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:24,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 06:49:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209075485] [2022-04-05 06:49:24,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:24,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:49:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:49:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:49:24,027 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-05 06:49:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:24,169 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-05 06:49:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 06:49:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-05 06:49:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:24,177 INFO L225 Difference]: With dead ends: 122 [2022-04-05 06:49:24,177 INFO L226 Difference]: Without dead ends: 120 [2022-04-05 06:49:24,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-05 06:49:24,179 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:24,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 208 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-05 06:49:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-05 06:49:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-05 06:49:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-05 06:49:24,211 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-05 06:49:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:24,211 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-05 06:49:24,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-05 06:49:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-05 06:49:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-05 06:49:24,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:24,214 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:24,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:24,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:24,437 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-04-05 06:49:24,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:24,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904437782] [2022-04-05 06:49:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:24,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:24,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636004034] [2022-04-05 06:49:24,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:49:24,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:24,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:24,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 06:49:24,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-05 06:49:24,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:24,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-05 06:49:24,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-05 06:49:24,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-05 06:49:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:24,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904437782] [2022-04-05 06:49:24,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:24,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636004034] [2022-04-05 06:49:24,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636004034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:24,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:24,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-05 06:49:24,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604601401] [2022-04-05 06:49:24,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:24,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:49:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:49:24,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:49:24,894 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-05 06:49:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:25,089 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-05 06:49:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:49:25,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-05 06:49:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:25,090 INFO L225 Difference]: With dead ends: 146 [2022-04-05 06:49:25,090 INFO L226 Difference]: Without dead ends: 135 [2022-04-05 06:49:25,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-05 06:49:25,091 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:25,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:49:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-05 06:49:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-05 06:49:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-05 06:49:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-05 06:49:25,102 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-05 06:49:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:25,103 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-05 06:49:25,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-05 06:49:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-05 06:49:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-05 06:49:25,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:25,104 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:25,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:25,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:25,320 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-04-05 06:49:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:25,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913070028] [2022-04-05 06:49:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:25,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:25,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934493760] [2022-04-05 06:49:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:25,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:25,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:25,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:25,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-05 06:49:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:25,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-05 06:49:25,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 06:49:25,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-05 06:49:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913070028] [2022-04-05 06:49:26,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:26,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934493760] [2022-04-05 06:49:26,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934493760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:26,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-05 06:49:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710946758] [2022-04-05 06:49:26,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:26,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 06:49:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 06:49:26,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-05 06:49:26,229 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-05 06:49:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:26,472 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-05 06:49:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 06:49:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-05 06:49:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:26,473 INFO L225 Difference]: With dead ends: 148 [2022-04-05 06:49:26,473 INFO L226 Difference]: Without dead ends: 144 [2022-04-05 06:49:26,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:49:26,474 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:26,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-05 06:49:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-05 06:49:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-05 06:49:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-05 06:49:26,487 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-05 06:49:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:26,487 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-05 06:49:26,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-05 06:49:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-05 06:49:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-05 06:49:26,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:26,488 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:26,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:26,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-05 06:49:26,704 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-04-05 06:49:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:26,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042973923] [2022-04-05 06:49:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:26,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:26,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198770757] [2022-04-05 06:49:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:26,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:26,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:26,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:26,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-05 06:49:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:49:26,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-05 06:49:26,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-05 06:49:26,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042973923] [2022-04-05 06:49:27,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198770757] [2022-04-05 06:49:27,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198770757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:49:27,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:49:27,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-05 06:49:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471441519] [2022-04-05 06:49:27,231 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:27,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 06:49:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:27,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 06:49:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-05 06:49:27,232 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-05 06:49:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:27,343 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-05 06:49:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:49:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-05 06:49:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:27,344 INFO L225 Difference]: With dead ends: 143 [2022-04-05 06:49:27,344 INFO L226 Difference]: Without dead ends: 132 [2022-04-05 06:49:27,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 06:49:27,344 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:27,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-05 06:49:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-05 06:49:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-05 06:49:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-05 06:49:27,354 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-05 06:49:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:27,354 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-05 06:49:27,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-05 06:49:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-05 06:49:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-05 06:49:27,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:27,355 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:27,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:27,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:27,571 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-04-05 06:49:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:27,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535661899] [2022-04-05 06:49:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:27,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935697032] [2022-04-05 06:49:27,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 06:49:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:27,578 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:27,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-05 06:49:29,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 06:49:29,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:29,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-05 06:49:29,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-05 06:49:30,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-05 06:49:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535661899] [2022-04-05 06:49:30,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935697032] [2022-04-05 06:49:30,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935697032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:30,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:30,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-05 06:49:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499811624] [2022-04-05 06:49:30,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:30,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 06:49:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 06:49:30,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:49:30,485 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-05 06:49:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:30,639 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-05 06:49:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:49:30,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-05 06:49:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:30,640 INFO L225 Difference]: With dead ends: 142 [2022-04-05 06:49:30,640 INFO L226 Difference]: Without dead ends: 138 [2022-04-05 06:49:30,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-05 06:49:30,640 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:30,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-05 06:49:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-05 06:49:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-05 06:49:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-05 06:49:30,655 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-05 06:49:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:30,656 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-05 06:49:30,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-05 06:49:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-05 06:49:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-05 06:49:30,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:30,657 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:30,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:30,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-05 06:49:30,862 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-04-05 06:49:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924328669] [2022-04-05 06:49:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:30,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553829371] [2022-04-05 06:49:30,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:49:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:30,869 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:30,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-05 06:49:30,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:49:30,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-05 06:49:30,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-05 06:49:31,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924328669] [2022-04-05 06:49:31,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553829371] [2022-04-05 06:49:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553829371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:49:31,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:49:31,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-05 06:49:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115772316] [2022-04-05 06:49:31,344 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:31,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:49:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:49:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-05 06:49:31,345 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 06:49:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:31,469 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-05 06:49:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 06:49:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-05 06:49:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:31,470 INFO L225 Difference]: With dead ends: 140 [2022-04-05 06:49:31,470 INFO L226 Difference]: Without dead ends: 129 [2022-04-05 06:49:31,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-05 06:49:31,471 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:31,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:49:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-05 06:49:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-05 06:49:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-05 06:49:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-05 06:49:31,482 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-05 06:49:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:31,482 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-05 06:49:31,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 06:49:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-05 06:49:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-05 06:49:31,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:31,483 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:31,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:31,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-05 06:49:31,699 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-04-05 06:49:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:31,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602818085] [2022-04-05 06:49:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:31,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:31,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239745724] [2022-04-05 06:49:31,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:49:31,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:31,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:31,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-05 06:49:31,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:49:31,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-05 06:49:31,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-05 06:49:32,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602818085] [2022-04-05 06:49:32,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239745724] [2022-04-05 06:49:32,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239745724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:49:32,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:49:32,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 06:49:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238097214] [2022-04-05 06:49:32,362 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:32,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 06:49:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 06:49:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 06:49:32,362 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-05 06:49:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:32,589 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-05 06:49:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 06:49:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-05 06:49:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:32,590 INFO L225 Difference]: With dead ends: 152 [2022-04-05 06:49:32,590 INFO L226 Difference]: Without dead ends: 150 [2022-04-05 06:49:32,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:49:32,591 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:32,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:49:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-05 06:49:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-05 06:49:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-05 06:49:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-05 06:49:32,610 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-05 06:49:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:32,611 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-05 06:49:32,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-05 06:49:32,611 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-05 06:49:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-05 06:49:32,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:32,612 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:32,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-05 06:49:32,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-05 06:49:32,831 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-04-05 06:49:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:32,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856242877] [2022-04-05 06:49:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:32,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:32,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344732610] [2022-04-05 06:49:32,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:49:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:32,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:32,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-05 06:49:32,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:49:32,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:32,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 06:49:32,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-05 06:49:33,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-05 06:49:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856242877] [2022-04-05 06:49:33,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344732610] [2022-04-05 06:49:33,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344732610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:49:33,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:49:33,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-05 06:49:33,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743217292] [2022-04-05 06:49:33,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:33,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 06:49:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 06:49:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:49:33,344 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-05 06:49:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:33,664 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-05 06:49:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-05 06:49:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-05 06:49:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:33,666 INFO L225 Difference]: With dead ends: 368 [2022-04-05 06:49:33,666 INFO L226 Difference]: Without dead ends: 353 [2022-04-05 06:49:33,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-05 06:49:33,667 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:33,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 355 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:49:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-05 06:49:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-05 06:49:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-05 06:49:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-05 06:49:33,693 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-05 06:49:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:33,693 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-05 06:49:33,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-05 06:49:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-05 06:49:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-05 06:49:33,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:33,694 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:33,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:33,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-05 06:49:33,911 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-04-05 06:49:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927630614] [2022-04-05 06:49:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:33,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:33,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352094322] [2022-04-05 06:49:33,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:49:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:33,923 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:33,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-05 06:49:34,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-05 06:49:34,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-05 06:49:34,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-05 06:49:34,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927630614] [2022-04-05 06:49:34,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352094322] [2022-04-05 06:49:34,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352094322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:49:34,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:49:34,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 06:49:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727803032] [2022-04-05 06:49:34,877 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:34,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 06:49:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 06:49:34,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 06:49:34,879 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-05 06:49:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:35,096 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-05 06:49:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 06:49:35,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-05 06:49:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:35,106 INFO L225 Difference]: With dead ends: 313 [2022-04-05 06:49:35,106 INFO L226 Difference]: Without dead ends: 302 [2022-04-05 06:49:35,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:49:35,106 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:35,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:49:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-05 06:49:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-05 06:49:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-05 06:49:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-05 06:49:35,134 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-05 06:49:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:35,136 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-05 06:49:35,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-05 06:49:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-05 06:49:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-05 06:49:35,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:35,137 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:35,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-05 06:49:35,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:35,344 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-04-05 06:49:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860008459] [2022-04-05 06:49:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:35,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:35,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167571322] [2022-04-05 06:49:35,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:49:35,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:35,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:35,351 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:35,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-05 06:49:35,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-05 06:49:35,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:35,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 06:49:35,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:49:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-05 06:49:36,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:49:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:49:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860008459] [2022-04-05 06:49:38,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:49:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167571322] [2022-04-05 06:49:38,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167571322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:49:38,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:49:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 06:49:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801773292] [2022-04-05 06:49:38,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 06:49:38,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 06:49:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:49:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 06:49:38,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-05 06:49:38,081 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 06:49:40,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:49:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:49:40,612 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-05 06:49:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 06:49:40,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-05 06:49:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:49:40,613 INFO L225 Difference]: With dead ends: 311 [2022-04-05 06:49:40,613 INFO L226 Difference]: Without dead ends: 309 [2022-04-05 06:49:40,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-04-05 06:49:40,614 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-05 06:49:40,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 131 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-05 06:49:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-05 06:49:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-05 06:49:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-05 06:49:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-05 06:49:40,643 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-05 06:49:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:49:40,643 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-05 06:49:40,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 06:49:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-05 06:49:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-05 06:49:40,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:49:40,645 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:49:40,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-05 06:49:40,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-05 06:49:40,849 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:49:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:49:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-04-05 06:49:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:49:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782018456] [2022-04-05 06:49:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:49:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:49:40,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:49:40,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364028868] [2022-04-05 06:49:40,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 06:49:40,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:49:40,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:49:40,860 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:49:40,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-05 06:49:42,702 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 06:49:42,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:49:42,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-05 06:49:42,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:50:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 256 proven. 354 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-05 06:50:07,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:50:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-04-05 06:50:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:50:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782018456] [2022-04-05 06:50:11,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:50:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364028868] [2022-04-05 06:50:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364028868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:50:11,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:50:11,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-05 06:50:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702351469] [2022-04-05 06:50:11,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:50:11,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-05 06:50:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:50:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-05 06:50:11,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=269, Unknown=4, NotChecked=0, Total=342 [2022-04-05 06:50:11,731 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 13 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 11 states have call predecessors, (34), 13 states have call successors, (34) [2022-04-05 06:50:13,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:17,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:19,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:27,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:28,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:30,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 06:50:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:50:34,569 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-05 06:50:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 06:50:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 13 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 11 states have call predecessors, (34), 13 states have call successors, (34) Word has length 160 [2022-04-05 06:50:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:50:34,571 INFO L225 Difference]: With dead ends: 315 [2022-04-05 06:50:34,571 INFO L226 Difference]: Without dead ends: 294 [2022-04-05 06:50:34,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=134, Invalid=462, Unknown=4, NotChecked=0, Total=600 [2022-04-05 06:50:34,571 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 103 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:50:34,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 183 Invalid, 3 Unknown, 0 Unchecked, 21.1s Time] [2022-04-05 06:50:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-05 06:50:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-05 06:50:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-05 06:50:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-05 06:50:34,595 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-05 06:50:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:50:34,596 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-05 06:50:34,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 13 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 11 states have call predecessors, (34), 13 states have call successors, (34) [2022-04-05 06:50:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-05 06:50:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-05 06:50:34,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:50:34,597 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:50:34,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-05 06:50:34,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:34,803 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:50:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:50:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-04-05 06:50:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:50:34,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254526271] [2022-04-05 06:50:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:50:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:50:34,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:50:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672206171] [2022-04-05 06:50:34,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:50:34,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:50:34,813 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:50:34,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-05 06:50:35,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-05 06:50:35,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:50:35,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-05 06:50:35,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:50:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-05 06:50:35,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:50:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-04-05 06:50:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:50:36,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254526271] [2022-04-05 06:50:36,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:50:36,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672206171] [2022-04-05 06:50:36,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672206171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:50:36,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:50:36,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-05 06:50:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332146201] [2022-04-05 06:50:36,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:50:36,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 06:50:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:50:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 06:50:36,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-05 06:50:36,160 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-05 06:50:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:50:36,821 INFO L93 Difference]: Finished difference Result 640 states and 652 transitions. [2022-04-05 06:50:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-05 06:50:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-05 06:50:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:50:36,823 INFO L225 Difference]: With dead ends: 640 [2022-04-05 06:50:36,823 INFO L226 Difference]: Without dead ends: 630 [2022-04-05 06:50:36,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-05 06:50:36,826 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 225 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 06:50:36,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 532 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 06:50:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-04-05 06:50:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-04-05 06:50:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-05 06:50:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2022-04-05 06:50:36,904 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 297 [2022-04-05 06:50:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:50:36,905 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2022-04-05 06:50:36,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-05 06:50:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-05 06:50:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2022-04-05 06:50:36,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:50:36,910 INFO L499 BasicCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:50:36,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-05 06:50:37,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:37,115 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:50:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:50:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash 3134423, now seen corresponding path program 4 times [2022-04-05 06:50:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:50:37,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326169769] [2022-04-05 06:50:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:50:37,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:50:37,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:50:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056419133] [2022-04-05 06:50:37,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 06:50:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:37,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:50:37,137 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:50:37,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-05 06:50:37,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 06:50:37,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:50:37,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-05 06:50:37,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:50:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-04-05 06:50:38,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:50:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-04-05 06:50:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:50:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326169769] [2022-04-05 06:50:39,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:50:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056419133] [2022-04-05 06:50:39,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056419133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:50:39,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:50:39,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-05 06:50:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865873904] [2022-04-05 06:50:39,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:50:39,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-05 06:50:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:50:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-05 06:50:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-05 06:50:39,759 INFO L87 Difference]: Start difference. First operand 630 states and 631 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-05 06:50:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:50:41,717 INFO L93 Difference]: Finished difference Result 1312 states and 1336 transitions. [2022-04-05 06:50:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-05 06:50:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-05 06:50:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:50:41,722 INFO L225 Difference]: With dead ends: 1312 [2022-04-05 06:50:41,722 INFO L226 Difference]: Without dead ends: 1302 [2022-04-05 06:50:41,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-05 06:50:41,724 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 443 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 06:50:41,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 774 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 06:50:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-05 06:50:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-04-05 06:50:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-05 06:50:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1303 transitions. [2022-04-05 06:50:41,821 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1303 transitions. Word has length 633 [2022-04-05 06:50:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:50:41,821 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1303 transitions. [2022-04-05 06:50:41,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-05 06:50:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-05 06:50:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2022-04-05 06:50:41,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:50:41,833 INFO L499 BasicCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:50:41,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-05 06:50:42,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:42,047 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:50:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:50:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -624487321, now seen corresponding path program 5 times [2022-04-05 06:50:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:50:42,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308092391] [2022-04-05 06:50:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:50:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:50:42,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:50:42,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178242660] [2022-04-05 06:50:42,083 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 06:50:42,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:50:42,084 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:50:42,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-05 06:50:50,170 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-04-05 06:50:50,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:50:50,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-05 06:50:50,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:50:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-04-05 06:50:52,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:50:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-04-05 06:50:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:50:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308092391] [2022-04-05 06:50:54,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 06:50:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178242660] [2022-04-05 06:50:54,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178242660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:50:54,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 06:50:54,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-05 06:50:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453540605] [2022-04-05 06:50:54,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 06:50:54,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-05 06:50:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:50:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-05 06:50:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-05 06:50:54,493 INFO L87 Difference]: Start difference. First operand 1302 states and 1303 transitions. Second operand has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (466), 49 states have call predecessors, (466), 49 states have return successors, (464), 51 states have call predecessors, (464), 51 states have call successors, (464) [2022-04-05 06:50:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:50:56,422 INFO L93 Difference]: Finished difference Result 1424 states and 1428 transitions. [2022-04-05 06:50:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-05 06:50:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (466), 49 states have call predecessors, (466), 49 states have return successors, (464), 51 states have call predecessors, (464), 51 states have call successors, (464) Word has length 1305 [2022-04-05 06:50:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:50:56,428 INFO L225 Difference]: With dead ends: 1424 [2022-04-05 06:50:56,428 INFO L226 Difference]: Without dead ends: 1414 [2022-04-05 06:50:56,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2658 GetRequests, 2556 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-04-05 06:50:56,431 INFO L913 BasicCegarLoop]: 271 mSDtfsCounter, 168 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 06:50:56,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 806 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 06:50:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-04-05 06:50:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2022-04-05 06:50:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 908 states have (on average 1.001101321585903) internal successors, (909), 908 states have internal predecessors, (909), 254 states have call successors, (254), 253 states have call predecessors, (254), 251 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-04-05 06:50:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1415 transitions. [2022-04-05 06:50:56,540 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1415 transitions. Word has length 1305 [2022-04-05 06:50:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:50:56,541 INFO L478 AbstractCegarLoop]: Abstraction has 1414 states and 1415 transitions. [2022-04-05 06:50:56,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (466), 49 states have call predecessors, (466), 49 states have return successors, (464), 51 states have call predecessors, (464), 51 states have call successors, (464) [2022-04-05 06:50:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1415 transitions. [2022-04-05 06:50:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2022-04-05 06:50:56,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:50:56,554 INFO L499 BasicCegarLoop]: trace histogram [252, 251, 251, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:50:56,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-05 06:50:56,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:56,766 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:50:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:50:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -184755073, now seen corresponding path program 6 times [2022-04-05 06:50:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:50:56,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131374110] [2022-04-05 06:50:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:50:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:50:56,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 06:50:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825991792] [2022-04-05 06:50:56,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-05 06:50:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:50:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:50:56,795 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:50:56,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-05 06:51:52,350 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2022-04-05 06:51:52,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-05 06:51:52,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 06:51:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 06:51:53,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 06:51:53,375 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 06:51:53,376 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 06:51:53,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-05 06:51:53,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-05 06:51:53,603 INFO L719 BasicCegarLoop]: Path program histogram: [6, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-04-05 06:51:53,607 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 06:51:53,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:51:53 BasicIcfg [2022-04-05 06:51:53,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 06:51:53,764 INFO L158 Benchmark]: Toolchain (without parser) took 154035.99ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 131.9MB in the beginning and 132.5MB in the end (delta: -632.7kB). Peak memory consumption was 137.1MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,764 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 06:51:53,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.44ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 131.7MB in the beginning and 196.5MB in the end (delta: -64.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,764 INFO L158 Benchmark]: Boogie Preprocessor took 31.76ms. Allocated memory is still 220.2MB. Free memory was 196.5MB in the beginning and 195.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,764 INFO L158 Benchmark]: RCFGBuilder took 284.90ms. Allocated memory is still 220.2MB. Free memory was 195.2MB in the beginning and 184.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,765 INFO L158 Benchmark]: IcfgTransformer took 20.32ms. Allocated memory is still 220.2MB. Free memory was 184.0MB in the beginning and 182.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,766 INFO L158 Benchmark]: TraceAbstraction took 153470.24ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 182.2MB in the beginning and 132.5MB in the end (delta: 49.7MB). Peak memory consumption was 151.4MB. Max. memory is 8.0GB. [2022-04-05 06:51:53,771 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.11ms. Allocated memory is still 183.5MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.44ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 131.7MB in the beginning and 196.5MB in the end (delta: -64.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.76ms. Allocated memory is still 220.2MB. Free memory was 196.5MB in the beginning and 195.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.90ms. Allocated memory is still 220.2MB. Free memory was 195.2MB in the beginning and 184.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 20.32ms. Allocated memory is still 220.2MB. Free memory was 184.0MB in the beginning and 182.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 153470.24ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 182.2MB in the beginning and 132.5MB in the end (delta: 49.7MB). Peak memory consumption was 151.4MB. Max. memory is 8.0GB. * 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=52, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=50, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=21, n=20, x=8000, y=1261, z=126] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=21, n=20, x=8000, y=1261, z=126] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=21, n=20, x=8000, y=1261, z=126] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=21, n=20, x=8000, y=1261, z=126] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=22, counter++=21, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=22, n=21, x=9261, y=1387, z=132] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=22, n=21, x=9261, y=1387, z=132] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=22, n=21, x=9261, y=1387, z=132] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=22, n=21, x=9261, y=1387, z=132] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=23, counter++=22, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=23, n=22, x=10648, y=1519, z=138] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=23, n=22, x=10648, y=1519, z=138] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=23, n=22, x=10648, y=1519, z=138] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=23, n=22, x=10648, y=1519, z=138] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=24, counter++=23, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=24, n=23, x=12167, y=1657, z=144] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=24, n=23, x=12167, y=1657, z=144] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=24, n=23, x=12167, y=1657, z=144] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=24, n=23, x=12167, y=1657, z=144] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=25, counter++=24, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=25, n=24, x=13824, y=1801, z=150] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=25, n=24, x=13824, y=1801, z=150] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=25, n=24, x=13824, y=1801, z=150] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=25, n=24, x=13824, y=1801, z=150] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=26, counter++=25, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=26, n=25, x=15625, y=1951, z=156] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=26, n=25, x=15625, y=1951, z=156] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=26, n=25, x=15625, y=1951, z=156] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=26, n=25, x=15625, y=1951, z=156] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=27, counter++=26, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=27, n=26, x=17576, y=2107, z=162] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=27, n=26, x=17576, y=2107, z=162] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=27, n=26, x=17576, y=2107, z=162] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=27, n=26, x=17576, y=2107, z=162] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=28, counter++=27, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=28, n=27, x=19683, y=2269, z=168] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=28, n=27, x=19683, y=2269, z=168] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=28, n=27, x=19683, y=2269, z=168] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=28, n=27, x=19683, y=2269, z=168] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=29, counter++=28, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=29, n=28, x=21952, y=2437, z=174] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=29, n=28, x=21952, y=2437, z=174] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=29, n=28, x=21952, y=2437, z=174] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=29, n=28, x=21952, y=2437, z=174] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=30, counter++=29, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=30, n=29, x=24389, y=2611, z=180] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=30, n=29, x=24389, y=2611, z=180] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=30, n=29, x=24389, y=2611, z=180] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=30, n=29, x=24389, y=2611, z=180] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=31, counter++=30, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=31, n=30, x=27000, y=2791, z=186] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=31, n=30, x=27000, y=2791, z=186] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=31, n=30, x=27000, y=2791, z=186] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=31, n=30, x=27000, y=2791, z=186] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=32, counter++=31, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=32, n=31, x=29791, y=2977, z=192] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=32, n=31, x=29791, y=2977, z=192] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=32, n=31, x=29791, y=2977, z=192] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=32, n=31, x=29791, y=2977, z=192] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=33, counter++=32, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=33, n=32, x=32768, y=3169, z=198] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=33, n=32, x=32768, y=3169, z=198] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=33, n=32, x=32768, y=3169, z=198] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=33, n=32, x=32768, y=3169, z=198] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=34, counter++=33, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=34, n=33, x=35937, y=3367, z=204] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=34, n=33, x=35937, y=3367, z=204] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=34, n=33, x=35937, y=3367, z=204] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=34, n=33, x=35937, y=3367, z=204] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=35, counter++=34, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=35, n=34, x=39304, y=3571, z=210] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=35, n=34, x=39304, y=3571, z=210] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=35, n=34, x=39304, y=3571, z=210] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=35, n=34, x=39304, y=3571, z=210] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=36, counter++=35, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=36, n=35, x=42875, y=3781, z=216] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=36, n=35, x=42875, y=3781, z=216] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=36, n=35, x=42875, y=3781, z=216] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=36, n=35, x=42875, y=3781, z=216] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=37, counter++=36, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=37, n=36, x=46656, y=3997, z=222] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=37, n=36, x=46656, y=3997, z=222] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=37, n=36, x=46656, y=3997, z=222] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=37, n=36, x=46656, y=3997, z=222] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=38, counter++=37, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=38, n=37, x=50653, y=4219, z=228] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=38, n=37, x=50653, y=4219, z=228] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=38, n=37, x=50653, y=4219, z=228] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=38, n=37, x=50653, y=4219, z=228] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=39, counter++=38, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=39, n=38, x=54872, y=4447, z=234] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=39, n=38, x=54872, y=4447, z=234] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=39, n=38, x=54872, y=4447, z=234] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=39, n=38, x=54872, y=4447, z=234] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=40, counter++=39, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=40, n=39, x=59319, y=4681, z=240] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=40, n=39, x=59319, y=4681, z=240] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=40, n=39, x=59319, y=4681, z=240] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=40, n=39, x=59319, y=4681, z=240] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=41, counter++=40, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=41, n=40, x=64000, y=4921, z=246] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=41, n=40, x=64000, y=4921, z=246] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=41, n=40, x=64000, y=4921, z=246] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=41, n=40, x=64000, y=4921, z=246] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=42, counter++=41, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=42, n=41, x=68921, y=5167, z=252] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=42, n=41, x=68921, y=5167, z=252] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=42, n=41, x=68921, y=5167, z=252] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=42, n=41, x=68921, y=5167, z=252] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=43, counter++=42, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=43, n=42, x=74088, y=5419, z=258] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=43, n=42, x=74088, y=5419, z=258] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=43, n=42, x=74088, y=5419, z=258] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=43, n=42, x=74088, y=5419, z=258] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=44, counter++=43, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=44, n=43, x=79507, y=5677, z=264] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=44, n=43, x=79507, y=5677, z=264] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=44, n=43, x=79507, y=5677, z=264] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=44, n=43, x=79507, y=5677, z=264] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=45, counter++=44, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=45, n=44, x=85184, y=5941, z=270] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=45, n=44, x=85184, y=5941, z=270] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=45, n=44, x=85184, y=5941, z=270] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=45, n=44, x=85184, y=5941, z=270] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=46, counter++=45, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=46, n=45, x=91125, y=6211, z=276] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=46, n=45, x=91125, y=6211, z=276] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=46, n=45, x=91125, y=6211, z=276] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=46, n=45, x=91125, y=6211, z=276] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=47, counter++=46, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=47, n=46, x=97336, y=6487, z=282] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=47, n=46, x=97336, y=6487, z=282] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=47, n=46, x=97336, y=6487, z=282] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=47, n=46, x=97336, y=6487, z=282] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=48, counter++=47, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=48, n=47, x=103823, y=6769, z=288] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=48, n=47, x=103823, y=6769, z=288] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=48, n=47, x=103823, y=6769, z=288] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=48, n=47, x=103823, y=6769, z=288] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=49, counter++=48, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=49, n=48, x=110592, y=7057, z=294] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=49, n=48, x=110592, y=7057, z=294] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=49, n=48, x=110592, y=7057, z=294] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=49, n=48, x=110592, y=7057, z=294] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=50, counter++=49, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=50, counter=50, n=49, x=117649, y=7351, z=300] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=50, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=50, counter=50, n=49, x=117649, y=7351, z=300] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=50, counter=50, n=49, x=117649, y=7351, z=300] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=50, counter=50, n=49, x=117649, y=7351, z=300] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=50, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [\old(counter)=0, a=50, counter=51, counter++=50, n=50, x=125000, y=7651, z=306] [L33] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=50, counter=51, n=50, x=125000, y=7651, z=306] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.2s, OverallIterations: 23, TraceHistogramMax: 252, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 1303 SdHoareTripleChecker+Valid, 27.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1246 mSDsluCounter, 5019 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3506 mSDsCounter, 1581 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5833 IncrementalHoareTripleChecker+Invalid, 7418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1581 mSolverCounterUnsat, 1513 mSDtfsCounter, 5833 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6735 GetRequests, 6292 SyntacticMatches, 20 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3124 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1414occurred in iteration=22, InterpolantAutomatonStates: 395, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 69.1s SatisfiabilityAnalysisTime, 44.5s InterpolantComputationTime, 4980 NumberOfCodeBlocks, 4709 NumberOfCodeBlocksAsserted, 400 NumberOfCheckSat, 6398 ConstructedInterpolants, 0 QuantifiedInterpolants, 19545 SizeOfPredicates, 132 NumberOfNonLiveVariables, 7616 ConjunctsInSsa, 524 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 151848/305562 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-04-05 06:51:53,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...