/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 10:07:29,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 10:07:29,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 10:07:29,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 10:07:29,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 10:07:29,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 10:07:29,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 10:07:29,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 10:07:29,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 10:07:29,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 10:07:29,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 10:07:29,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 10:07:29,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 10:07:29,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 10:07:29,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 10:07:29,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 10:07:29,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 10:07:29,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 10:07:29,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 10:07:29,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 10:07:29,427 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 10:07:29,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 10:07:29,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 10:07:29,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 10:07:29,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 10:07:29,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 10:07:29,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 10:07:29,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 10:07:29,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 10:07:29,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 10:07:29,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 10:07:29,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 10:07:29,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 10:07:29,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 10:07:29,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 10:07:29,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 10:07:29,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 10:07:29,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 10:07:29,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 10:07:29,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 10:07:29,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 10:07:29,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 10:07:29,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-20 10:07:29,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 10:07:29,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 10:07:29,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 10:07:29,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 10:07:29,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 10:07:29,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 10:07:29,478 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 10:07:29,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 10:07:29,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 10:07:29,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 10:07:29,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 10:07:29,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 10:07:29,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 10:07:29,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 10:07:29,481 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 10:07:29,482 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 10:07:29,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 10:07:29,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 10:07:29,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 10:07:29,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 10:07:29,697 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 10:07:29,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c [2022-03-20 10:07:29,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd30984f/a3722cb2dd584999a63beb277159422e/FLAGf8bed2ba1 [2022-03-20 10:07:30,073 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 10:07:30,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c [2022-03-20 10:07:30,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd30984f/a3722cb2dd584999a63beb277159422e/FLAGf8bed2ba1 [2022-03-20 10:07:30,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd30984f/a3722cb2dd584999a63beb277159422e [2022-03-20 10:07:30,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 10:07:30,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 10:07:30,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 10:07:30,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 10:07:30,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 10:07:30,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576aa9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30, skipping insertion in model container [2022-03-20 10:07:30,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 10:07:30,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 10:07:30,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c[489,502] [2022-03-20 10:07:30,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 10:07:30,670 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 10:07:30,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c[489,502] [2022-03-20 10:07:30,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 10:07:30,690 INFO L208 MainTranslator]: Completed translation [2022-03-20 10:07:30,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30 WrapperNode [2022-03-20 10:07:30,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 10:07:30,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 10:07:30,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 10:07:30,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 10:07:30,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 10:07:30,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 10:07:30,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 10:07:30,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 10:07:30,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 10:07:30,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:30,742 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-03-20 10:07:30,747 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-03-20 10:07:30,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 10:07:30,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 10:07:30,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 10:07:30,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 10:07:30,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 10:07:30,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 10:07:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 10:07:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 10:07:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 10:07:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 10:07:30,819 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 10:07:30,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 10:07:30,946 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 10:07:30,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 10:07:30,951 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 10:07:30,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 10:07:30 BoogieIcfgContainer [2022-03-20 10:07:30,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 10:07:30,954 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 10:07:30,954 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 10:07:30,955 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 10:07:30,957 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 10:07:30" (1/1) ... [2022-03-20 10:07:30,959 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 10:07:30,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 10:07:30 BasicIcfg [2022-03-20 10:07:30,973 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 10:07:30,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 10:07:30,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 10:07:30,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 10:07:30,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 10:07:30" (1/4) ... [2022-03-20 10:07:30,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 10:07:30, skipping insertion in model container [2022-03-20 10:07:30,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 10:07:30" (2/4) ... [2022-03-20 10:07:30,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 10:07:30, skipping insertion in model container [2022-03-20 10:07:30,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 10:07:30" (3/4) ... [2022-03-20 10:07:30,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 10:07:30, skipping insertion in model container [2022-03-20 10:07:30,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 10:07:30" (4/4) ... [2022-03-20 10:07:30,978 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.cqvasr [2022-03-20 10:07:30,982 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 10:07:30,982 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 10:07:31,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 10:07:31,028 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 10:07:31,028 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 10:07:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-20 10:07:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 10:07:31,043 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:31,044 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:31,044 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2051628946, now seen corresponding path program 1 times [2022-03-20 10:07:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:31,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702490966] [2022-03-20 10:07:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 10:07:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 10:07:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 10:07:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 10:07:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702490966] [2022-03-20 10:07:31,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702490966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 10:07:31,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 10:07:31,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 10:07:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880787032] [2022-03-20 10:07:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:31,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 10:07:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 10:07:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 10:07:31,229 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 10:07:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:31,292 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-03-20 10:07:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 10:07:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-03-20 10:07:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:31,299 INFO L225 Difference]: With dead ends: 64 [2022-03-20 10:07:31,299 INFO L226 Difference]: Without dead ends: 31 [2022-03-20 10:07:31,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 10:07:31,304 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:31,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-20 10:07:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-20 10:07:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-03-20 10:07:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-03-20 10:07:31,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-03-20 10:07:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:31,331 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-03-20 10:07:31,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 10:07:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-03-20 10:07:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 10:07:31,333 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:31,333 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:31,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 10:07:31,333 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash -794581502, now seen corresponding path program 1 times [2022-03-20 10:07:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:31,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518724139] [2022-03-20 10:07:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 10:07:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 10:07:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 10:07:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 10:07:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518724139] [2022-03-20 10:07:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518724139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 10:07:31,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 10:07:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 10:07:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109677056] [2022-03-20 10:07:31,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:31,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:31,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 10:07:31,429 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 10:07:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:31,541 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-03-20 10:07:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 10:07:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-03-20 10:07:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:31,542 INFO L225 Difference]: With dead ends: 42 [2022-03-20 10:07:31,543 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 10:07:31,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-03-20 10:07:31,544 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:31,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 10:07:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 10:07:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 10:07:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-03-20 10:07:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-03-20 10:07:31,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-03-20 10:07:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:31,551 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-03-20 10:07:31,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 10:07:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-03-20 10:07:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 10:07:31,552 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:31,552 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:31,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 10:07:31,553 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -793509026, now seen corresponding path program 1 times [2022-03-20 10:07:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:31,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342226328] [2022-03-20 10:07:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:31,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:31,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530287218] [2022-03-20 10:07:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:31,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:31,578 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-03-20 10:07:31,627 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-03-20 10:07:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:31,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 10:07:31,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 10:07:31,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 10:07:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:31,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342226328] [2022-03-20 10:07:31,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530287218] [2022-03-20 10:07:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530287218] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 10:07:31,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 10:07:31,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 10:07:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467437489] [2022-03-20 10:07:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:31,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 10:07:31,782 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 10:07:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:31,817 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-03-20 10:07:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 10:07:31,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-03-20 10:07:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:31,818 INFO L225 Difference]: With dead ends: 49 [2022-03-20 10:07:31,818 INFO L226 Difference]: Without dead ends: 47 [2022-03-20 10:07:31,819 INFO L912 BasicCegarLoop]: 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-03-20 10:07:31,819 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:31,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-20 10:07:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-03-20 10:07:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-03-20 10:07:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-03-20 10:07:31,827 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-03-20 10:07:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:31,828 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-03-20 10:07:31,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 10:07:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-03-20 10:07:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 10:07:31,828 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:31,829 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:31,855 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-03-20 10:07:32,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:32,056 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2115229340, now seen corresponding path program 1 times [2022-03-20 10:07:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872670164] [2022-03-20 10:07:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:32,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:32,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260153442] [2022-03-20 10:07:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:32,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:32,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:32,068 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-03-20 10:07:32,072 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-03-20 10:07:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:32,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 10:07:32,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 10:07:32,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:32,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872670164] [2022-03-20 10:07:32,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260153442] [2022-03-20 10:07:32,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260153442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 10:07:32,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 10:07:32,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-20 10:07:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158110726] [2022-03-20 10:07:32,450 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:32,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 10:07:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:32,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 10:07:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 10:07:32,453 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 10:07:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:32,547 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-03-20 10:07:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 10:07:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-03-20 10:07:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:32,551 INFO L225 Difference]: With dead ends: 53 [2022-03-20 10:07:32,551 INFO L226 Difference]: Without dead ends: 51 [2022-03-20 10:07:32,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-20 10:07:32,555 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:32,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 222 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 10:07:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-20 10:07:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-03-20 10:07:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-03-20 10:07:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-03-20 10:07:32,582 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-03-20 10:07:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:32,583 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-03-20 10:07:32,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 10:07:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-03-20 10:07:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 10:07:32,589 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:32,589 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:32,609 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-03-20 10:07:32,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 10:07:32,790 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:32,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash -864241798, now seen corresponding path program 1 times [2022-03-20 10:07:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:32,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382353007] [2022-03-20 10:07:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:32,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663263804] [2022-03-20 10:07:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:32,801 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-03-20 10:07:32,823 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-03-20 10:07:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:32,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 10:07:32,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 10:07:32,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-20 10:07:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382353007] [2022-03-20 10:07:33,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663263804] [2022-03-20 10:07:33,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663263804] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 10:07:33,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 10:07:33,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-20 10:07:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701878122] [2022-03-20 10:07:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:33,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 10:07:33,085 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 10:07:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:33,119 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-03-20 10:07:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 10:07:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-03-20 10:07:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:33,122 INFO L225 Difference]: With dead ends: 75 [2022-03-20 10:07:33,122 INFO L226 Difference]: Without dead ends: 71 [2022-03-20 10:07:33,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 10:07:33,123 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:33,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 144 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-20 10:07:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-03-20 10:07:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-03-20 10:07:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-03-20 10:07:33,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-03-20 10:07:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:33,132 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-03-20 10:07:33,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 10:07:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-03-20 10:07:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 10:07:33,133 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:33,133 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:33,171 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-03-20 10:07:33,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:33,352 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -120478471, now seen corresponding path program 1 times [2022-03-20 10:07:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044059107] [2022-03-20 10:07:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:33,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:33,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280151030] [2022-03-20 10:07:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:33,380 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-03-20 10:07:33,384 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-03-20 10:07:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:33,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 10:07:33,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 10:07:33,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 10:07:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:33,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044059107] [2022-03-20 10:07:33,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:33,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280151030] [2022-03-20 10:07:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280151030] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 10:07:33,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 10:07:33,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 10:07:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202160911] [2022-03-20 10:07:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:33,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 10:07:33,481 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 10:07:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:33,511 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-03-20 10:07:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 10:07:33,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-03-20 10:07:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:33,512 INFO L225 Difference]: With dead ends: 87 [2022-03-20 10:07:33,512 INFO L226 Difference]: Without dead ends: 85 [2022-03-20 10:07:33,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-03-20 10:07:33,513 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:33,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 153 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-03-20 10:07:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-03-20 10:07:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-20 10:07:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-03-20 10:07:33,522 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-03-20 10:07:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:33,522 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-03-20 10:07:33,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 10:07:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-03-20 10:07:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 10:07:33,523 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:33,523 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:33,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 10:07:33,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:33,759 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1628466672, now seen corresponding path program 1 times [2022-03-20 10:07:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940713255] [2022-03-20 10:07:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:33,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:33,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476058106] [2022-03-20 10:07:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:33,775 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-03-20 10:07:33,795 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-03-20 10:07:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 10:07:33,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 10:07:33,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 10:07:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940713255] [2022-03-20 10:07:34,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:34,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476058106] [2022-03-20 10:07:34,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476058106] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 10:07:34,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 10:07:34,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-20 10:07:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828495152] [2022-03-20 10:07:34,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:34,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 10:07:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 10:07:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-20 10:07:34,017 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-03-20 10:07:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:34,126 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2022-03-20 10:07:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 10:07:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-03-20 10:07:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:34,131 INFO L225 Difference]: With dead ends: 222 [2022-03-20 10:07:34,131 INFO L226 Difference]: Without dead ends: 200 [2022-03-20 10:07:34,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 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-03-20 10:07:34,133 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:34,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 224 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 10:07:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-03-20 10:07:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-03-20 10:07:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-03-20 10:07:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2022-03-20 10:07:34,171 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 42 [2022-03-20 10:07:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:34,171 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2022-03-20 10:07:34,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-03-20 10:07:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2022-03-20 10:07:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 10:07:34,172 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:34,172 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:34,192 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-03-20 10:07:34,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:34,390 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1627394196, now seen corresponding path program 1 times [2022-03-20 10:07:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:34,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920537336] [2022-03-20 10:07:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:34,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:34,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375047546] [2022-03-20 10:07:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:34,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:34,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:34,403 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-03-20 10:07:34,412 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-03-20 10:07:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:34,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 10:07:34,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 10:07:34,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 10:07:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:34,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920537336] [2022-03-20 10:07:34,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:34,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375047546] [2022-03-20 10:07:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375047546] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 10:07:34,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 10:07:34,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 10:07:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490424574] [2022-03-20 10:07:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:34,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 10:07:34,556 INFO L87 Difference]: Start difference. First operand 194 states and 251 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 10:07:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:34,592 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2022-03-20 10:07:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 10:07:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-03-20 10:07:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:34,594 INFO L225 Difference]: With dead ends: 208 [2022-03-20 10:07:34,594 INFO L226 Difference]: Without dead ends: 203 [2022-03-20 10:07:34,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 10:07:34,595 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:34,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-03-20 10:07:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-03-20 10:07:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-03-20 10:07:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2022-03-20 10:07:34,609 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 42 [2022-03-20 10:07:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:34,609 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2022-03-20 10:07:34,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 10:07:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-03-20 10:07:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 10:07:34,610 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:34,610 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:34,631 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-03-20 10:07:34,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:34,830 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1527150038, now seen corresponding path program 1 times [2022-03-20 10:07:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073117050] [2022-03-20 10:07:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:34,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:34,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402036114] [2022-03-20 10:07:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:34,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:34,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:34,843 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-03-20 10:07:34,859 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-03-20 10:07:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:34,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 10:07:34,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 10:07:34,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 10:07:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:35,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073117050] [2022-03-20 10:07:35,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:35,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402036114] [2022-03-20 10:07:35,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402036114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 10:07:35,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 10:07:35,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-20 10:07:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550423482] [2022-03-20 10:07:35,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:35,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 10:07:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 10:07:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-20 10:07:35,071 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-03-20 10:07:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:35,200 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2022-03-20 10:07:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 10:07:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-03-20 10:07:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:35,202 INFO L225 Difference]: With dead ends: 232 [2022-03-20 10:07:35,202 INFO L226 Difference]: Without dead ends: 216 [2022-03-20 10:07:35,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 10:07:35,203 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:35,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 165 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 10:07:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-03-20 10:07:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-03-20 10:07:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-03-20 10:07:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-03-20 10:07:35,217 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 44 [2022-03-20 10:07:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:35,218 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-03-20 10:07:35,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-03-20 10:07:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-03-20 10:07:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 10:07:35,218 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:35,219 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:35,259 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-03-20 10:07:35,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:35,444 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1237367986, now seen corresponding path program 2 times [2022-03-20 10:07:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:35,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116343114] [2022-03-20 10:07:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:35,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562482584] [2022-03-20 10:07:35,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 10:07:35,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:35,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:35,456 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-03-20 10:07:35,468 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-03-20 10:07:35,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 10:07:35,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 10:07:35,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 10:07:35,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 10:07:35,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 10:07:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:35,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116343114] [2022-03-20 10:07:35,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:35,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562482584] [2022-03-20 10:07:35,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562482584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 10:07:35,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 10:07:35,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 10:07:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392064944] [2022-03-20 10:07:35,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:35,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 10:07:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 10:07:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 10:07:35,771 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-03-20 10:07:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:36,311 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2022-03-20 10:07:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 10:07:36,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-03-20 10:07:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:36,313 INFO L225 Difference]: With dead ends: 253 [2022-03-20 10:07:36,313 INFO L226 Difference]: Without dead ends: 229 [2022-03-20 10:07:36,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-20 10:07:36,314 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:36,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 210 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 10:07:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-20 10:07:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2022-03-20 10:07:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-03-20 10:07:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2022-03-20 10:07:36,330 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 47 [2022-03-20 10:07:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:36,330 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2022-03-20 10:07:36,330 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-03-20 10:07:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2022-03-20 10:07:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 10:07:36,331 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:36,331 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:36,349 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-03-20 10:07:36,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-20 10:07:36,549 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -264996897, now seen corresponding path program 1 times [2022-03-20 10:07:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816116054] [2022-03-20 10:07:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:36,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:36,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714711494] [2022-03-20 10:07:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:36,560 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-03-20 10:07:36,561 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-03-20 10:07:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 10:07:36,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-20 10:07:36,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-20 10:07:36,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-03-20 10:07:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816116054] [2022-03-20 10:07:36,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714711494] [2022-03-20 10:07:36,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714711494] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 10:07:36,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 10:07:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-03-20 10:07:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308315374] [2022-03-20 10:07:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 10:07:36,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 10:07:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 10:07:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 10:07:36,912 INFO L87 Difference]: Start difference. First operand 210 states and 240 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 10:07:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:36,998 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-03-20 10:07:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 10:07:36,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-03-20 10:07:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:36,999 INFO L225 Difference]: With dead ends: 216 [2022-03-20 10:07:36,999 INFO L226 Difference]: Without dead ends: 192 [2022-03-20 10:07:37,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-03-20 10:07:37,000 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:37,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 111 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 10:07:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-03-20 10:07:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-03-20 10:07:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-03-20 10:07:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2022-03-20 10:07:37,028 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 61 [2022-03-20 10:07:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:37,028 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2022-03-20 10:07:37,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 10:07:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2022-03-20 10:07:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-20 10:07:37,029 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:37,029 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:37,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-20 10:07:37,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:37,248 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1503864962, now seen corresponding path program 2 times [2022-03-20 10:07:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:37,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60076219] [2022-03-20 10:07:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:37,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:37,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396057548] [2022-03-20 10:07:37,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 10:07:37,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:37,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:37,258 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-03-20 10:07:37,261 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-03-20 10:07:37,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 10:07:37,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 10:07:37,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 10:07:37,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 10:07:37,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-03-20 10:07:37,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:37,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60076219] [2022-03-20 10:07:37,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:37,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396057548] [2022-03-20 10:07:37,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396057548] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 10:07:37,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 10:07:37,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-20 10:07:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939844313] [2022-03-20 10:07:37,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:37,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 10:07:37,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 10:07:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-20 10:07:37,628 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-03-20 10:07:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:37,829 INFO L93 Difference]: Finished difference Result 516 states and 605 transitions. [2022-03-20 10:07:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-20 10:07:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2022-03-20 10:07:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:37,832 INFO L225 Difference]: With dead ends: 516 [2022-03-20 10:07:37,832 INFO L226 Difference]: Without dead ends: 507 [2022-03-20 10:07:37,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 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-03-20 10:07:37,833 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 140 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:37,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 200 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 10:07:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-03-20 10:07:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2022-03-20 10:07:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-03-20 10:07:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 572 transitions. [2022-03-20 10:07:37,865 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 572 transitions. Word has length 99 [2022-03-20 10:07:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:37,866 INFO L478 AbstractCegarLoop]: Abstraction has 507 states and 572 transitions. [2022-03-20 10:07:37,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-03-20 10:07:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-03-20 10:07:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-03-20 10:07:37,867 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:37,868 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:37,887 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-03-20 10:07:38,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-20 10:07:38,088 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1084056642, now seen corresponding path program 3 times [2022-03-20 10:07:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:38,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116818619] [2022-03-20 10:07:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:38,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:38,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091113252] [2022-03-20 10:07:38,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 10:07:38,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:38,139 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-03-20 10:07:38,140 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-03-20 10:07:38,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-03-20 10:07:38,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 10:07:38,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 10:07:38,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 10:07:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-03-20 10:07:38,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 10:07:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-03-20 10:07:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 10:07:39,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116818619] [2022-03-20 10:07:39,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 10:07:39,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091113252] [2022-03-20 10:07:39,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091113252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 10:07:39,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 10:07:39,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-20 10:07:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174534361] [2022-03-20 10:07:39,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 10:07:39,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 10:07:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 10:07:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 10:07:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 10:07:39,040 INFO L87 Difference]: Start difference. First operand 507 states and 572 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) [2022-03-20 10:07:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 10:07:39,537 INFO L93 Difference]: Finished difference Result 1046 states and 1221 transitions. [2022-03-20 10:07:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-20 10:07:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) Word has length 213 [2022-03-20 10:07:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 10:07:39,542 INFO L225 Difference]: With dead ends: 1046 [2022-03-20 10:07:39,542 INFO L226 Difference]: Without dead ends: 1037 [2022-03-20 10:07:39,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-03-20 10:07:39,543 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 285 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 10:07:39,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 330 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 10:07:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-03-20 10:07:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2022-03-20 10:07:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 685 states have (on average 1.0905109489051095) internal successors, (747), 705 states have internal predecessors, (747), 214 states have call successors, (214), 138 states have call predecessors, (214), 137 states have return successors, (211), 193 states have call predecessors, (211), 211 states have call successors, (211) [2022-03-20 10:07:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1172 transitions. [2022-03-20 10:07:39,603 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1172 transitions. Word has length 213 [2022-03-20 10:07:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 10:07:39,603 INFO L478 AbstractCegarLoop]: Abstraction has 1037 states and 1172 transitions. [2022-03-20 10:07:39,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) [2022-03-20 10:07:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1172 transitions. [2022-03-20 10:07:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-03-20 10:07:39,608 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 10:07:39,608 INFO L499 BasicCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:39,641 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-03-20 10:07:39,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 10:07:39,827 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 10:07:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 10:07:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2008789634, now seen corresponding path program 4 times [2022-03-20 10:07:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 10:07:39,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762868144] [2022-03-20 10:07:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 10:07:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 10:07:39,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 10:07:39,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859886430] [2022-03-20 10:07:39,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 10:07:39,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 10:07:39,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 10:07:39,841 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-03-20 10:07:39,842 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-03-20 10:07:39,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 10:07:39,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-20 10:07:39,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 10:07:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 10:07:40,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 10:07:40,226 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 10:07:40,226 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 10:07:40,247 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-03-20 10:07:40,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 10:07:40,431 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 10:07:40,434 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 10:07:40,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 10:07:40 BasicIcfg [2022-03-20 10:07:40,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 10:07:40,579 INFO L158 Benchmark]: Toolchain (without parser) took 10085.17ms. Allocated memory was 202.4MB in the beginning and 292.6MB in the end (delta: 90.2MB). Free memory was 153.2MB in the beginning and 248.4MB in the end (delta: -95.2MB). Peak memory consumption was 112.0MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,579 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 215.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 10:07:40,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 202.4MB. Free memory was 153.0MB in the beginning and 180.7MB in the end (delta: -27.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,580 INFO L158 Benchmark]: Boogie Preprocessor took 19.89ms. Allocated memory is still 202.4MB. Free memory was 180.7MB in the beginning and 179.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,580 INFO L158 Benchmark]: RCFGBuilder took 239.54ms. Allocated memory is still 202.4MB. Free memory was 179.3MB in the beginning and 168.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,580 INFO L158 Benchmark]: IcfgTransformer took 18.48ms. Allocated memory is still 202.4MB. Free memory was 168.8MB in the beginning and 167.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,581 INFO L158 Benchmark]: TraceAbstraction took 9604.78ms. Allocated memory was 202.4MB in the beginning and 292.6MB in the end (delta: 90.2MB). Free memory was 166.7MB in the beginning and 248.4MB in the end (delta: -81.8MB). Peak memory consumption was 126.7MB. Max. memory is 8.0GB. [2022-03-20 10:07:40,581 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.10ms. Allocated memory is still 202.4MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 215.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 202.4MB. Free memory was 153.0MB in the beginning and 180.7MB in the end (delta: -27.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.89ms. Allocated memory is still 202.4MB. Free memory was 180.7MB in the beginning and 179.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.54ms. Allocated memory is still 202.4MB. Free memory was 179.3MB in the beginning and 168.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 18.48ms. Allocated memory is still 202.4MB. Free memory was 168.8MB in the beginning and 167.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 9604.78ms. Allocated memory was 202.4MB in the beginning and 292.6MB in the end (delta: 90.2MB). Free memory was 166.7MB in the beginning and 248.4MB in the end (delta: -81.8MB). Peak memory consumption was 126.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=22, counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=43, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=43, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=43, b=2, counter=0, p=1, q=0, r=0, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=43, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=41, b=2, counter=1, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=41, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=39, b=2, counter=2, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=39, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=37, b=2, counter=3, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=37, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=35, b=2, counter=4, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=35, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=33, b=2, counter=5, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=33, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=31, b=2, counter=6, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=31, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=29, b=2, counter=7, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=29, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=27, b=2, counter=8, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=27, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=25, b=2, counter=9, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=25, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=23, b=2, counter=10, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=23, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=21, b=2, counter=11, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=19, b=2, counter=12, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=19, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=17, b=2, counter=13, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=17, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=15, b=2, counter=14, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=15, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=13, b=2, counter=15, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=11, b=2, counter=16, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=11, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=9, b=2, counter=17, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=9, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=7, b=2, counter=18, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=7, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=5, b=2, counter=19, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=2, counter=20, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 14, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 2164 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1575 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 589 mSDtfsCounter, 976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1268 GetRequests, 1128 SyntacticMatches, 9 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=13, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1119 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1235 ConstructedInterpolants, 0 QuantifiedInterpolants, 3389 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 2778/5429 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-03-20 10:07:40,620 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...