./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:33:14,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:33:14,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:33:14,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:33:14,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:33:14,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:33:14,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:33:14,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:33:14,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:33:14,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:33:14,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:33:14,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:33:14,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:33:14,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:33:14,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:33:14,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:33:14,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:33:14,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:33:14,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:33:14,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:33:14,247 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:33:14,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:33:14,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:33:14,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:33:14,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:33:14,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:33:14,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:33:14,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:33:14,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:33:14,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:33:14,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:33:14,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:33:14,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:33:14,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:33:14,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:33:14,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:33:14,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:33:14,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:33:14,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:33:14,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:33:14,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:33:14,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:33:14,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:33:14,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:33:14,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:33:14,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:33:14,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:33:14,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:33:14,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:33:14,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:33:14,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:33:14,294 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:33:14,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:33:14,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:33:14,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:33:14,296 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:33:14,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:33:14,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:33:14,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:33:14,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:33:14,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:33:14,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:33:14,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:33:14,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:33:14,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:33:14,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:33:14,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:33:14,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:33:14,299 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:33:14,299 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:33:14,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:33:14,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed [2022-07-19 15:33:14,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:33:14,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:33:14,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:33:14,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:33:14,536 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:33:14,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-07-19 15:33:14,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2f54838/74bf0789463743cdb3b08a8cee6fde21/FLAG59b69aaa6 [2022-07-19 15:33:14,950 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:33:14,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-07-19 15:33:14,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2f54838/74bf0789463743cdb3b08a8cee6fde21/FLAG59b69aaa6 [2022-07-19 15:33:15,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2f54838/74bf0789463743cdb3b08a8cee6fde21 [2022-07-19 15:33:15,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:33:15,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:33:15,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:33:15,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:33:15,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:33:15,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffe24cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15, skipping insertion in model container [2022-07-19 15:33:15,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:33:15,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:33:15,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-07-19 15:33:15,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:33:15,604 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:33:15,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-07-19 15:33:15,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:33:15,635 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:33:15,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15 WrapperNode [2022-07-19 15:33:15,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:33:15,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:33:15,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:33:15,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:33:15,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,661 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-07-19 15:33:15,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:33:15,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:33:15,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:33:15,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:33:15,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:33:15,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:33:15,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:33:15,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:33:15,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (1/1) ... [2022-07-19 15:33:15,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:33:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:15,731 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-07-19 15:33:15,734 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-07-19 15:33:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:33:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:33:15,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:33:15,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:33:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:33:15,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:33:15,836 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:33:15,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:33:15,993 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:33:16,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:33:16,004 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 15:33:16,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:33:16 BoogieIcfgContainer [2022-07-19 15:33:16,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:33:16,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:33:16,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:33:16,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:33:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:33:15" (1/3) ... [2022-07-19 15:33:16,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2137e2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:33:16, skipping insertion in model container [2022-07-19 15:33:16,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:33:15" (2/3) ... [2022-07-19 15:33:16,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2137e2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:33:16, skipping insertion in model container [2022-07-19 15:33:16,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:33:16" (3/3) ... [2022-07-19 15:33:16,014 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-07-19 15:33:16,025 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:33:16,026 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:33:16,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:33:16,089 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44a5ecc3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22fed748 [2022-07-19 15:33:16,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:33:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 15:33:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 15:33:16,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:16,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:16,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-07-19 15:33:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:16,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747740954] [2022-07-19 15:33:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:16,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:16,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747740954] [2022-07-19 15:33:16,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747740954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:16,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:16,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 15:33:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818421015] [2022-07-19 15:33:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:16,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 15:33:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 15:33:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:33:16,282 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:16,304 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-07-19 15:33:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 15:33:16,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-19 15:33:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:16,321 INFO L225 Difference]: With dead ends: 50 [2022-07-19 15:33:16,321 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 15:33:16,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 15:33:16,328 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:16,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:33:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 15:33:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 15:33:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 15:33:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-07-19 15:33:16,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-07-19 15:33:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:16,378 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-07-19 15:33:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-07-19 15:33:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 15:33:16,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:16,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:33:16,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-07-19 15:33:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784578235] [2022-07-19 15:33:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:16,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784578235] [2022-07-19 15:33:16,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784578235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:16,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:16,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:33:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650348845] [2022-07-19 15:33:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:33:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:33:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:33:16,500 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:16,533 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-07-19 15:33:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 15:33:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 15:33:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:16,534 INFO L225 Difference]: With dead ends: 36 [2022-07-19 15:33:16,534 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 15:33:16,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:33:16,536 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:16,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:33:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 15:33:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-19 15:33:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 15:33:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-07-19 15:33:16,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-07-19 15:33:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:16,557 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-19 15:33:16,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-07-19 15:33:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 15:33:16,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:16,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:16,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:33:16,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-07-19 15:33:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275348506] [2022-07-19 15:33:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275348506] [2022-07-19 15:33:16,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275348506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:16,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:16,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:33:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796328962] [2022-07-19 15:33:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:16,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:33:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:33:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:33:16,651 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:16,723 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-07-19 15:33:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:33:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 15:33:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:16,724 INFO L225 Difference]: With dead ends: 30 [2022-07-19 15:33:16,724 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 15:33:16,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-07-19 15:33:16,725 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:16,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 15:33:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 15:33:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 15:33:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-19 15:33:16,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-07-19 15:33:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:16,732 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-19 15:33:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:33:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-07-19 15:33:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 15:33:16,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:16,733 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:16,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 15:33:16,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-07-19 15:33:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:16,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746313752] [2022-07-19 15:33:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:16,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039174742] [2022-07-19 15:33:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:16,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:16,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:16,750 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-07-19 15:33:16,751 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-07-19 15:33:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:16,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:33:16,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:33:16,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:33:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746313752] [2022-07-19 15:33:16,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039174742] [2022-07-19 15:33:16,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039174742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:16,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:16,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:33:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571478188] [2022-07-19 15:33:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:16,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:33:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:16,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:33:16,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:33:16,867 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 15:33:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:16,937 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-19 15:33:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:33:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-19 15:33:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:16,939 INFO L225 Difference]: With dead ends: 46 [2022-07-19 15:33:16,939 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 15:33:16,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-07-19 15:33:16,940 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 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-07-19 15:33:16,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 15:33:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-07-19 15:33:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 15:33:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-07-19 15:33:16,949 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-07-19 15:33:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:16,949 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-19 15:33:16,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 15:33:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-07-19 15:33:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 15:33:16,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:16,950 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:16,968 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-07-19 15:33:17,167 WARN L477 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-07-19 15:33:17,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-07-19 15:33:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:17,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010250995] [2022-07-19 15:33:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:17,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:17,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306459494] [2022-07-19 15:33:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:17,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:17,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:17,201 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-07-19 15:33:17,203 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-07-19 15:33:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:17,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:33:17,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 15:33:17,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:33:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010250995] [2022-07-19 15:33:17,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306459494] [2022-07-19 15:33:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306459494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:17,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:33:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661073268] [2022-07-19 15:33:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:17,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:33:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:33:17,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:33:17,303 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 15:33:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:17,372 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-07-19 15:33:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:33:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-07-19 15:33:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:17,376 INFO L225 Difference]: With dead ends: 50 [2022-07-19 15:33:17,377 INFO L226 Difference]: Without dead ends: 48 [2022-07-19 15:33:17,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-07-19 15:33:17,379 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 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-07-19 15:33:17,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:33:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-19 15:33:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-07-19 15:33:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-19 15:33:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-07-19 15:33:17,395 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-07-19 15:33:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:17,396 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-07-19 15:33:17,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 15:33:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-07-19 15:33:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 15:33:17,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:17,397 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:17,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:17,614 WARN L477 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-07-19 15:33:17,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:17,616 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-07-19 15:33:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:17,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211813160] [2022-07-19 15:33:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:17,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:17,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524104256] [2022-07-19 15:33:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:17,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:17,628 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-07-19 15:33:17,629 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-07-19 15:33:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:17,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:33:17,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 15:33:17,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:33:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:17,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211813160] [2022-07-19 15:33:17,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:17,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524104256] [2022-07-19 15:33:17,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524104256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:33:17,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:33:17,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:33:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039179382] [2022-07-19 15:33:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:33:17,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:33:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:33:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:33:17,753 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 15:33:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:17,808 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-19 15:33:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:33:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-07-19 15:33:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:17,810 INFO L225 Difference]: With dead ends: 58 [2022-07-19 15:33:17,810 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 15:33:17,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-07-19 15:33:17,811 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 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.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:17,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:33:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 15:33:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-19 15:33:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 15:33:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-19 15:33:17,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-07-19 15:33:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:17,830 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-19 15:33:17,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 15:33:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-19 15:33:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 15:33:17,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:17,833 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:17,861 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-07-19 15:33:18,045 WARN L477 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-07-19 15:33:18,046 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-07-19 15:33:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:18,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882851881] [2022-07-19 15:33:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:18,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:18,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981186046] [2022-07-19 15:33:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:18,063 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-07-19 15:33:18,064 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-07-19 15:33:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 15:33:18,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 15:33:18,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:33:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:18,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882851881] [2022-07-19 15:33:18,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981186046] [2022-07-19 15:33:18,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981186046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:18,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:18,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-19 15:33:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848921663] [2022-07-19 15:33:18,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:18,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:18,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:33:18,210 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 15:33:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:18,321 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-07-19 15:33:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 15:33:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2022-07-19 15:33:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:18,323 INFO L225 Difference]: With dead ends: 116 [2022-07-19 15:33:18,323 INFO L226 Difference]: Without dead ends: 100 [2022-07-19 15:33:18,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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-07-19 15:33:18,324 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:18,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-19 15:33:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-19 15:33:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-19 15:33:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-19 15:33:18,337 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 41 [2022-07-19 15:33:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:18,338 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-19 15:33:18,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 15:33:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-19 15:33:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 15:33:18,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:18,339 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:18,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 15:33:18,556 WARN L477 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-07-19 15:33:18,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2022-07-19 15:33:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:18,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982334208] [2022-07-19 15:33:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:18,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762311264] [2022-07-19 15:33:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:18,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:18,567 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-07-19 15:33:18,584 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-07-19 15:33:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:18,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 15:33:18,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:33:18,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:33:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:18,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982334208] [2022-07-19 15:33:18,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:18,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762311264] [2022-07-19 15:33:18,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762311264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:18,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:18,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-19 15:33:18,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509761945] [2022-07-19 15:33:18,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:18,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:18,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:33:18,782 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 8 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), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 15:33:20,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:33:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:20,286 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-07-19 15:33:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:33:20,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 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), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-07-19 15:33:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:20,288 INFO L225 Difference]: With dead ends: 114 [2022-07-19 15:33:20,288 INFO L226 Difference]: Without dead ends: 112 [2022-07-19 15:33:20,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:33:20,289 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:20,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 15:33:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-19 15:33:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-19 15:33:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-19 15:33:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-07-19 15:33:20,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2022-07-19 15:33:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-07-19 15:33:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 15:33:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-07-19 15:33:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 15:33:20,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:20,305 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:20,337 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-07-19 15:33:20,522 WARN L477 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-07-19 15:33:20,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2022-07-19 15:33:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:20,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003784322] [2022-07-19 15:33:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:20,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:20,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746344677] [2022-07-19 15:33:20,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:33:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:20,549 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-07-19 15:33:20,551 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-07-19 15:33:20,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:33:20,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:20,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 15:33:20,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 15:33:20,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 15:33:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:20,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003784322] [2022-07-19 15:33:20,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:20,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746344677] [2022-07-19 15:33:20,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746344677] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:20,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:20,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-19 15:33:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147916847] [2022-07-19 15:33:20,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:20,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:33:20,718 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-19 15:33:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:20,833 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-07-19 15:33:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:33:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-07-19 15:33:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:20,835 INFO L225 Difference]: With dead ends: 118 [2022-07-19 15:33:20,835 INFO L226 Difference]: Without dead ends: 116 [2022-07-19 15:33:20,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 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-07-19 15:33:20,835 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:20,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-19 15:33:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-19 15:33:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-19 15:33:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-19 15:33:20,849 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 46 [2022-07-19 15:33:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:20,849 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-19 15:33:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-19 15:33:20,849 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-19 15:33:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 15:33:20,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:20,850 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:20,899 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-07-19 15:33:21,067 WARN L477 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-07-19 15:33:21,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2022-07-19 15:33:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036356571] [2022-07-19 15:33:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:21,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:21,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381025882] [2022-07-19 15:33:21,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:33:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:21,092 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-07-19 15:33:21,092 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-07-19 15:33:21,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 15:33:21,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:21,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 15:33:21,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 15:33:21,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 15:33:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:21,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036356571] [2022-07-19 15:33:21,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:21,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381025882] [2022-07-19 15:33:21,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381025882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:21,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:21,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-19 15:33:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910990201] [2022-07-19 15:33:21,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:21,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:33:21,391 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 15:33:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:21,585 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2022-07-19 15:33:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:33:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-07-19 15:33:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:21,586 INFO L225 Difference]: With dead ends: 142 [2022-07-19 15:33:21,586 INFO L226 Difference]: Without dead ends: 131 [2022-07-19 15:33:21,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 15:33:21,587 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:21,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:33:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-19 15:33:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-19 15:33:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-19 15:33:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-07-19 15:33:21,597 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 51 [2022-07-19 15:33:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:21,597 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-07-19 15:33:21,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 15:33:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-07-19 15:33:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 15:33:21,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:21,598 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:21,628 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-07-19 15:33:21,815 WARN L477 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-07-19 15:33:21,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2022-07-19 15:33:21,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:21,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158742319] [2022-07-19 15:33:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:21,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:21,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841640062] [2022-07-19 15:33:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:21,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:21,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:21,824 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-07-19 15:33:21,839 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-07-19 15:33:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:21,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 15:33:21,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 15:33:22,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158742319] [2022-07-19 15:33:22,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:22,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841640062] [2022-07-19 15:33:22,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841640062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:33:22,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:33:22,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-07-19 15:33:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497788073] [2022-07-19 15:33:22,918 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:22,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 15:33:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 15:33:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-19 15:33:22,919 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-19 15:33:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:23,200 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-19 15:33:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 15:33:23,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 67 [2022-07-19 15:33:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:23,201 INFO L225 Difference]: With dead ends: 133 [2022-07-19 15:33:23,201 INFO L226 Difference]: Without dead ends: 124 [2022-07-19 15:33:23,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-19 15:33:23,202 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:23,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:33:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-19 15:33:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-19 15:33:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-19 15:33:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-19 15:33:23,212 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 67 [2022-07-19 15:33:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:23,213 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-19 15:33:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-19 15:33:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-19 15:33:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 15:33:23,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:23,214 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-19 15:33:23,231 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-07-19 15:33:23,431 WARN L477 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-07-19 15:33:23,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -207258189, now seen corresponding path program 4 times [2022-07-19 15:33:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:23,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513987843] [2022-07-19 15:33:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:23,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514697868] [2022-07-19 15:33:23,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 15:33:23,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:23,445 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-07-19 15:33:23,446 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-07-19 15:33:24,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 15:33:24,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:24,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 15:33:24,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 61 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-07-19 15:33:25,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 23 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-19 15:33:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513987843] [2022-07-19 15:33:25,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514697868] [2022-07-19 15:33:25,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514697868] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:25,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:25,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-19 15:33:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980585729] [2022-07-19 15:33:25,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:25,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 15:33:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 15:33:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-19 15:33:25,737 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-19 15:33:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:26,095 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-19 15:33:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:33:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) Word has length 74 [2022-07-19 15:33:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:26,097 INFO L225 Difference]: With dead ends: 134 [2022-07-19 15:33:26,097 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 15:33:26,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-07-19 15:33:26,097 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:26,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 15:33:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 15:33:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-07-19 15:33:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-19 15:33:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-19 15:33:26,110 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2022-07-19 15:33:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:26,110 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-19 15:33:26,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-19 15:33:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-19 15:33:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 15:33:26,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:26,111 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:33:26,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-19 15:33:26,317 WARN L477 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-07-19 15:33:26,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash 308615369, now seen corresponding path program 2 times [2022-07-19 15:33:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:26,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987288131] [2022-07-19 15:33:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:26,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:26,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762574956] [2022-07-19 15:33:26,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:33:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:26,348 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-07-19 15:33:26,368 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-07-19 15:33:26,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:33:26,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:26,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 15:33:26,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-07-19 15:33:26,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987288131] [2022-07-19 15:33:26,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762574956] [2022-07-19 15:33:26,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762574956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:33:26,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:33:26,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-19 15:33:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763288899] [2022-07-19 15:33:26,767 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:26,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:33:26,768 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 15:33:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:26,918 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-07-19 15:33:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 15:33:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2022-07-19 15:33:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:26,919 INFO L225 Difference]: With dead ends: 134 [2022-07-19 15:33:26,919 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 15:33:26,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-19 15:33:26,920 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:26,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 15:33:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-19 15:33:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-19 15:33:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-07-19 15:33:26,939 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 95 [2022-07-19 15:33:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:26,939 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-07-19 15:33:26,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 15:33:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-07-19 15:33:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 15:33:26,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:26,940 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:26,957 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-07-19 15:33:27,158 WARN L477 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-07-19 15:33:27,158 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash 75049244, now seen corresponding path program 1 times [2022-07-19 15:33:27,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:27,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271525510] [2022-07-19 15:33:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:27,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:27,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918980140] [2022-07-19 15:33:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:27,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:27,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:27,168 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-07-19 15:33:27,169 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-07-19 15:33:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:33:27,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 15:33:27,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-19 15:33:27,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271525510] [2022-07-19 15:33:27,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918980140] [2022-07-19 15:33:27,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918980140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:33:27,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:33:27,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-19 15:33:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196283412] [2022-07-19 15:33:27,677 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 15:33:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:27,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 15:33:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 15:33:27,678 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 15:33:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:27,866 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-07-19 15:33:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 15:33:27,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2022-07-19 15:33:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:27,869 INFO L225 Difference]: With dead ends: 138 [2022-07-19 15:33:27,869 INFO L226 Difference]: Without dead ends: 125 [2022-07-19 15:33:27,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-19 15:33:27,869 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:27,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:33:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-19 15:33:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-19 15:33:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-19 15:33:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-07-19 15:33:27,883 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 100 [2022-07-19 15:33:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:27,884 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-07-19 15:33:27,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 15:33:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-07-19 15:33:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 15:33:27,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:27,885 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:27,902 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-07-19 15:33:28,099 WARN L477 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-07-19 15:33:28,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1859389073, now seen corresponding path program 3 times [2022-07-19 15:33:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:28,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595508143] [2022-07-19 15:33:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:28,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688225604] [2022-07-19 15:33:28,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:33:28,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:28,109 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-07-19 15:33:28,110 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-07-19 15:33:28,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:33:28,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:28,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 15:33:28,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-07-19 15:33:28,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:30,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595508143] [2022-07-19 15:33:30,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:30,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688225604] [2022-07-19 15:33:30,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688225604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:33:30,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:33:30,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-07-19 15:33:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161023941] [2022-07-19 15:33:30,748 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:30,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 15:33:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 15:33:30,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-07-19 15:33:30,749 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-19 15:33:35,932 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-07-19 15:33:37,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:33:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:37,162 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2022-07-19 15:33:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 15:33:37,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 123 [2022-07-19 15:33:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:37,163 INFO L225 Difference]: With dead ends: 134 [2022-07-19 15:33:37,163 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 15:33:37,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2022-07-19 15:33:37,163 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:37,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 15:33:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 15:33:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-07-19 15:33:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-19 15:33:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-07-19 15:33:37,175 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2022-07-19 15:33:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:37,175 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-07-19 15:33:37,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-19 15:33:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-07-19 15:33:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 15:33:37,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:37,176 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:37,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 15:33:37,382 WARN L477 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-07-19 15:33:37,382 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2022-07-19 15:33:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:37,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330344850] [2022-07-19 15:33:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:37,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:37,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986798412] [2022-07-19 15:33:37,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:33:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:37,396 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-07-19 15:33:37,397 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-07-19 15:33:37,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:33:37,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:37,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 15:33:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-19 15:33:37,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-07-19 15:33:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330344850] [2022-07-19 15:33:37,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986798412] [2022-07-19 15:33:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986798412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:33:37,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:33:37,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-19 15:33:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505854712] [2022-07-19 15:33:37,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:33:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:33:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:33:37,716 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-19 15:33:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:37,987 INFO L93 Difference]: Finished difference Result 390 states and 406 transitions. [2022-07-19 15:33:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 15:33:37,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2022-07-19 15:33:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:37,989 INFO L225 Difference]: With dead ends: 390 [2022-07-19 15:33:37,990 INFO L226 Difference]: Without dead ends: 365 [2022-07-19 15:33:37,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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-07-19 15:33:37,991 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 117 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:33:37,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 351 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:33:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-19 15:33:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 313. [2022-07-19 15:33:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 203 states have internal predecessors, (205), 63 states have call successors, (63), 54 states have call predecessors, (63), 53 states have return successors, (61), 55 states have call predecessors, (61), 61 states have call successors, (61) [2022-07-19 15:33:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 329 transitions. [2022-07-19 15:33:38,015 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 329 transitions. Word has length 125 [2022-07-19 15:33:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:38,016 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 329 transitions. [2022-07-19 15:33:38,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-07-19 15:33:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 329 transitions. [2022-07-19 15:33:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 15:33:38,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:38,017 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:38,040 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-07-19 15:33:38,239 WARN L477 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-07-19 15:33:38,240 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 709017654, now seen corresponding path program 2 times [2022-07-19 15:33:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:38,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754573228] [2022-07-19 15:33:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:38,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:38,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436691920] [2022-07-19 15:33:38,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:33:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:38,280 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-07-19 15:33:38,281 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-07-19 15:33:38,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:33:38,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:38,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 15:33:38,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:33:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-19 15:33:38,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:33:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:33:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754573228] [2022-07-19 15:33:38,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:33:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436691920] [2022-07-19 15:33:38,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436691920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:33:38,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:33:38,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-07-19 15:33:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782034929] [2022-07-19 15:33:38,679 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 15:33:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 15:33:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:33:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 15:33:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:33:38,681 INFO L87 Difference]: Start difference. First operand 313 states and 329 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-19 15:33:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:33:38,920 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2022-07-19 15:33:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 15:33:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 128 [2022-07-19 15:33:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:33:38,922 INFO L225 Difference]: With dead ends: 323 [2022-07-19 15:33:38,922 INFO L226 Difference]: Without dead ends: 312 [2022-07-19 15:33:38,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 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-07-19 15:33:38,923 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 202 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-07-19 15:33:38,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 202 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 15:33:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-19 15:33:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-19 15:33:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 202 states have internal predecessors, (204), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-19 15:33:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 326 transitions. [2022-07-19 15:33:38,955 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 326 transitions. Word has length 128 [2022-07-19 15:33:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:33:38,955 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 326 transitions. [2022-07-19 15:33:38,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-19 15:33:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 326 transitions. [2022-07-19 15:33:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 15:33:38,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:33:38,957 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:33:38,989 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-07-19 15:33:39,174 WARN L477 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-07-19 15:33:39,174 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:33:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:33:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 3 times [2022-07-19 15:33:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:33:39,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908450159] [2022-07-19 15:33:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:33:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:33:39,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:33:39,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266837152] [2022-07-19 15:33:39,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:33:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:33:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:33:39,205 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-07-19 15:33:39,253 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-07-19 15:33:40,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 15:33:40,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:33:40,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 15:33:40,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:34:28,644 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 15:34:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 366 proven. 76 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2022-07-19 15:34:28,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:34:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 271 proven. 34 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2022-07-19 15:34:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:34:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908450159] [2022-07-19 15:34:31,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:34:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266837152] [2022-07-19 15:34:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266837152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:34:31,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:34:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-19 15:34:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019128737] [2022-07-19 15:34:31,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:34:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 15:34:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:34:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 15:34:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-07-19 15:34:31,725 INFO L87 Difference]: Start difference. First operand 312 states and 326 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-19 15:34:45,310 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-07-19 15:34:47,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:34:49,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:34:51,729 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-07-19 15:34:53,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:34:54,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:34:56,826 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-07-19 15:34:58,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:34:59,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-19 15:35:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:35:03,279 INFO L93 Difference]: Finished difference Result 343 states and 350 transitions. [2022-07-19 15:35:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 15:35:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) Word has length 156 [2022-07-19 15:35:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:35:03,281 INFO L225 Difference]: With dead ends: 343 [2022-07-19 15:35:03,281 INFO L226 Difference]: Without dead ends: 290 [2022-07-19 15:35:03,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=143, Invalid=455, Unknown=2, NotChecked=0, Total=600 [2022-07-19 15:35:03,282 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 66 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:35:03,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 257 Invalid, 4 Unknown, 38 Unchecked, 21.1s Time] [2022-07-19 15:35:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-19 15:35:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-07-19 15:35:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 187 states have (on average 1.0053475935828877) internal successors, (188), 187 states have internal predecessors, (188), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-07-19 15:35:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2022-07-19 15:35:03,305 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 156 [2022-07-19 15:35:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:35:03,306 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2022-07-19 15:35:03,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-19 15:35:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2022-07-19 15:35:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-19 15:35:03,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:35:03,308 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:35:03,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-19 15:35:03,513 WARN L477 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-07-19 15:35:03,513 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:35:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:35:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2022-07-19 15:35:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:35:03,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240015860] [2022-07-19 15:35:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:35:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:35:03,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:35:03,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911398974] [2022-07-19 15:35:03,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:35:03,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:35:03,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:35:03,525 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-07-19 15:35:03,526 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-07-19 15:35:04,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-07-19 15:35:04,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:35:04,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 15:35:04,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:35:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-07-19 15:35:04,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:35:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-07-19 15:35:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:35:04,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240015860] [2022-07-19 15:35:04,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:35:04,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911398974] [2022-07-19 15:35:04,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911398974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:35:04,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:35:04,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-19 15:35:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227699581] [2022-07-19 15:35:04,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:35:04,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 15:35:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:35:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 15:35:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-19 15:35:04,797 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-07-19 15:35:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:35:05,553 INFO L93 Difference]: Finished difference Result 636 states and 648 transitions. [2022-07-19 15:35:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 15:35:05,553 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) Word has length 293 [2022-07-19 15:35:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:35:05,555 INFO L225 Difference]: With dead ends: 636 [2022-07-19 15:35:05,555 INFO L226 Difference]: Without dead ends: 626 [2022-07-19 15:35:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-19 15:35:05,557 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 292 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 15:35:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 389 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 15:35:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-07-19 15:35:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-07-19 15:35:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 403 states have (on average 1.0024813895781637) internal successors, (404), 403 states have internal predecessors, (404), 112 states have call successors, (112), 111 states have call predecessors, (112), 110 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-19 15:35:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2022-07-19 15:35:05,611 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 293 [2022-07-19 15:35:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:35:05,611 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2022-07-19 15:35:05,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-07-19 15:35:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2022-07-19 15:35:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-07-19 15:35:05,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:35:05,622 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:35:05,628 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-07-19 15:35:05,828 WARN L477 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-07-19 15:35:05,828 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:35:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:35:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1604221590, now seen corresponding path program 4 times [2022-07-19 15:35:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:35:05,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916574086] [2022-07-19 15:35:05,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:35:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:35:05,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:35:05,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500424531] [2022-07-19 15:35:05,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 15:35:05,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:35:05,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:35:05,848 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-07-19 15:35:05,850 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-07-19 15:35:06,336 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 15:35:06,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:35:06,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-19 15:35:06,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:35:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-07-19 15:35:07,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:35:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-07-19 15:35:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:35:07,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916574086] [2022-07-19 15:35:07,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:35:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500424531] [2022-07-19 15:35:07,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500424531] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:35:07,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:35:07,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-19 15:35:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552808325] [2022-07-19 15:35:07,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:35:07,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-19 15:35:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:35:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-19 15:35:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-19 15:35:07,941 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-07-19 15:35:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:35:09,490 INFO L93 Difference]: Finished difference Result 1308 states and 1332 transitions. [2022-07-19 15:35:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-19 15:35:09,491 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) Word has length 629 [2022-07-19 15:35:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:35:09,495 INFO L225 Difference]: With dead ends: 1308 [2022-07-19 15:35:09,495 INFO L226 Difference]: Without dead ends: 1298 [2022-07-19 15:35:09,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-19 15:35:09,500 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 488 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 15:35:09,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 736 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 15:35:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-07-19 15:35:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-07-19 15:35:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 835 states have (on average 1.0011976047904192) internal successors, (836), 835 states have internal predecessors, (836), 232 states have call successors, (232), 231 states have call predecessors, (232), 230 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2022-07-19 15:35:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1299 transitions. [2022-07-19 15:35:09,636 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1299 transitions. Word has length 629 [2022-07-19 15:35:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:35:09,637 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 1299 transitions. [2022-07-19 15:35:09,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-07-19 15:35:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1299 transitions. [2022-07-19 15:35:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2022-07-19 15:35:09,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:35:09,661 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:35:09,671 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-07-19 15:35:09,869 WARN L477 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-07-19 15:35:09,869 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:35:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:35:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1590306266, now seen corresponding path program 5 times [2022-07-19 15:35:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:35:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619231037] [2022-07-19 15:35:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:35:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:35:09,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:35:09,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760053062] [2022-07-19 15:35:09,893 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 15:35:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:35:09,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:35:09,895 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-07-19 15:35:09,911 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-07-19 15:35:30,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-07-19 15:35:30,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:35:30,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 2774 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-19 15:35:30,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:35:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-07-19 15:35:31,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:35:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-07-19 15:35:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:35:32,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619231037] [2022-07-19 15:35:32,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 15:35:32,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760053062] [2022-07-19 15:35:32,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760053062] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:35:32,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:35:32,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-07-19 15:35:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242611058] [2022-07-19 15:35:32,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:35:32,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-19 15:35:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:35:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-19 15:35:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-07-19 15:35:32,969 INFO L87 Difference]: Start difference. First operand 1298 states and 1299 transitions. Second operand has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-07-19 15:35:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:35:35,022 INFO L93 Difference]: Finished difference Result 1420 states and 1424 transitions. [2022-07-19 15:35:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-19 15:35:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) Word has length 1301 [2022-07-19 15:35:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:35:35,027 INFO L225 Difference]: With dead ends: 1420 [2022-07-19 15:35:35,028 INFO L226 Difference]: Without dead ends: 1410 [2022-07-19 15:35:35,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2649 GetRequests, 2547 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-07-19 15:35:35,031 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 167 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 15:35:35,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 792 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 15:35:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-07-19 15:35:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-07-19 15:35:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 907 states have (on average 1.0011025358324146) internal successors, (908), 907 states have internal predecessors, (908), 252 states have call successors, (252), 251 states have call predecessors, (252), 250 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) [2022-07-19 15:35:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1411 transitions. [2022-07-19 15:35:35,154 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1411 transitions. Word has length 1301 [2022-07-19 15:35:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:35:35,156 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 1411 transitions. [2022-07-19 15:35:35,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-07-19 15:35:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1411 transitions. [2022-07-19 15:35:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1414 [2022-07-19 15:35:35,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:35:35,174 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:35:35,191 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-07-19 15:35:35,391 WARN L477 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-07-19 15:35:35,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:35:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:35:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2117698370, now seen corresponding path program 6 times [2022-07-19 15:35:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:35:35,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011793010] [2022-07-19 15:35:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:35:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:35:35,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 15:35:35,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847503262] [2022-07-19 15:35:35,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 15:35:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:35:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:35:35,415 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-07-19 15:35:35,418 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-07-19 15:35:47,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2022-07-19 15:35:47,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-19 15:35:47,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 15:35:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 15:35:48,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 15:35:48,710 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 15:35:48,711 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:35:48,734 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-07-19 15:35:48,931 WARN L477 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-07-19 15:35:48,934 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-07-19 15:35:48,938 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:35:49,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 03:35:49 BoogieIcfgContainer [2022-07-19 15:35:49,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 15:35:49,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 15:35:49,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 15:35:49,151 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 15:35:49,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:33:16" (3/4) ... [2022-07-19 15:35:49,153 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 15:35:49,338 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 15:35:49,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 15:35:49,339 INFO L158 Benchmark]: Toolchain (without parser) took 153943.52ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 75.4MB in the beginning and 72.0MB in the end (delta: 3.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,339 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 47.9MB in the beginning and 47.8MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:35:49,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.25ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 83.4MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.96ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:35:49,342 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.9MB in the end (delta: 907.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,343 INFO L158 Benchmark]: RCFGBuilder took 321.27ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 70.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,344 INFO L158 Benchmark]: TraceAbstraction took 153141.51ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 69.7MB in the beginning and 36.2MB in the end (delta: 33.5MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,345 INFO L158 Benchmark]: Witness Printer took 187.12ms. Allocated memory is still 157.3MB. Free memory was 36.2MB in the beginning and 72.0MB in the end (delta: -35.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-19 15:35:49,349 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.16ms. Allocated memory is still 88.1MB. Free memory was 47.9MB in the beginning and 47.8MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.25ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 83.4MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.96ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.9MB in the end (delta: 907.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.27ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 70.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 153141.51ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 69.7MB in the beginning and 36.2MB in the end (delta: 33.5MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 187.12ms. Allocated memory is still 157.3MB. Free memory was 36.2MB in the beginning and 72.0MB in the end (delta: -35.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [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 [a=50, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [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, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [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 [a=50, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [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, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [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, counter=51] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 152.9s, OverallIterations: 22, TraceHistogramMax: 252, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 46.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1328 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1274 mSDsluCounter, 4286 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 2924 mSDsCounter, 1617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5871 IncrementalHoareTripleChecker+Invalid, 7531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1617 mSolverCounterUnsat, 1362 mSDtfsCounter, 5871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6396 GetRequests, 5969 SyntacticMatches, 15 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3118 ImplicationChecksByTransitivity, 38.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1410occurred in iteration=21, InterpolantAutomatonStates: 383, 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, 21 MinimizatonAttempts, 78 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 37.0s SatisfiabilityAnalysisTime, 62.6s InterpolantComputationTime, 4760 NumberOfCodeBlocks, 4502 NumberOfCodeBlocksAsserted, 399 NumberOfCheckSat, 6073 ConstructedInterpolants, 2 QuantifiedInterpolants, 17596 SizeOfPredicates, 122 NumberOfNonLiveVariables, 7008 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 150665/304120 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-07-19 15:35:49,419 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE