/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 16:50:51,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 16:50:51,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 16:50:51,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 16:50:51,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 16:50:51,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 16:50:51,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 16:50:51,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 16:50:51,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 16:50:51,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 16:50:51,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 16:50:51,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 16:50:51,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 16:50:51,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 16:50:51,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 16:50:51,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 16:50:51,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 16:50:51,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 16:50:51,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 16:50:51,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 16:50:51,616 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 16:50:51,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 16:50:51,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 16:50:51,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 16:50:51,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 16:50:51,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 16:50:51,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 16:50:51,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 16:50:51,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 16:50:51,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 16:50:51,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 16:50:51,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 16:50:51,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 16:50:51,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 16:50:51,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 16:50:51,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 16:50:51,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 16:50:51,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 16:50:51,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 16:50:51,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 16:50:51,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 16:50:51,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 16:50:51,641 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 16:50:51,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 16:50:51,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 16:50:51,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 16:50:51,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 16:50:51,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 16:50:51,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 16:50:51,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 16:50:51,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 16:50:51,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 16:50:51,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 16:50:51,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 16:50:51,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 16:50:51,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:50:51,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 16:50:51,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 16:50:51,656 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 16:50:51,657 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-17 16:50:51,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 16:50:51,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 16:50:51,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 16:50:51,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 16:50:51,919 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 16:50:51,920 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-17 16:50:51,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4472af0/5e7ba623fca84af795b79b8635572489/FLAG537701c1e [2022-03-17 16:50:52,327 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 16:50:52,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c [2022-03-17 16:50:52,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4472af0/5e7ba623fca84af795b79b8635572489/FLAG537701c1e [2022-03-17 16:50:52,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4472af0/5e7ba623fca84af795b79b8635572489 [2022-03-17 16:50:52,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 16:50:52,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 16:50:52,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 16:50:52,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 16:50:52,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 16:50:52,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:50:52" (1/1) ... [2022-03-17 16:50:52,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36511c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:52, skipping insertion in model container [2022-03-17 16:50:52,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:50:52" (1/1) ... [2022-03-17 16:50:52,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 16:50:52,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 16:50:52,930 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-17 16:50:52,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:50:52,971 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 16:50:52,984 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-17 16:50:52,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:50:53,009 INFO L208 MainTranslator]: Completed translation [2022-03-17 16:50:53,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53 WrapperNode [2022-03-17 16:50:53,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 16:50:53,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 16:50:53,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 16:50:53,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 16:50:53,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 16:50:53,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 16:50:53,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 16:50:53,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 16:50:53,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:50:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:53,075 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-17 16:50:53,080 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-17 16:50:53,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 16:50:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 16:50:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 16:50:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 16:50:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 16:50:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 16:50:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 16:50:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 16:50:53,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 16:50:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 16:50:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 16:50:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 16:50:53,158 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 16:50:53,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 16:50:53,274 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 16:50:53,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 16:50:53,279 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 16:50:53,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:50:53 BoogieIcfgContainer [2022-03-17 16:50:53,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 16:50:53,282 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 16:50:53,282 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 16:50:53,282 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 16:50:53,285 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:50:53" (1/1) ... [2022-03-17 16:50:53,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:50:53 BasicIcfg [2022-03-17 16:50:53,302 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 16:50:53,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 16:50:53,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 16:50:53,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 16:50:53,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:50:52" (1/4) ... [2022-03-17 16:50:53,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d76b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:50:53, skipping insertion in model container [2022-03-17 16:50:53,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:50:53" (2/4) ... [2022-03-17 16:50:53,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d76b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:50:53, skipping insertion in model container [2022-03-17 16:50:53,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:50:53" (3/4) ... [2022-03-17 16:50:53,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d76b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:50:53, skipping insertion in model container [2022-03-17 16:50:53,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:50:53" (4/4) ... [2022-03-17 16:50:53,308 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.cJordan [2022-03-17 16:50:53,312 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 16:50:53,312 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 16:50:53,346 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 16:50:53,352 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-17 16:50:53,352 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 16:50:53,363 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-17 16:50:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-17 16:50:53,369 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:53,369 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:50:53,370 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2051628946, now seen corresponding path program 1 times [2022-03-17 16:50:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:53,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314828195] [2022-03-17 16:50:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 16:50:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 16:50:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 16:50:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,591 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-17 16:50:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314828195] [2022-03-17 16:50:53,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314828195] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:50:53,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:50:53,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 16:50:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683009582] [2022-03-17 16:50:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:53,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 16:50:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 16:50:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 16:50:53,632 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-17 16:50:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:53,727 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-03-17 16:50:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 16:50:53,729 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-17 16:50:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:53,743 INFO L225 Difference]: With dead ends: 36 [2022-03-17 16:50:53,743 INFO L226 Difference]: Without dead ends: 31 [2022-03-17 16:50:53,747 INFO L911 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-17 16:50:53,751 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:53,752 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:50:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-17 16:50:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-17 16:50:53,789 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-17 16:50:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-03-17 16:50:53,791 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-03-17 16:50:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:53,793 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-03-17 16:50:53,793 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-17 16:50:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-03-17 16:50:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 16:50:53,794 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:53,794 INFO L500 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-17 16:50:53,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 16:50:53,795 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -794581502, now seen corresponding path program 1 times [2022-03-17 16:50:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093109027] [2022-03-17 16:50:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 16:50:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-17 16:50:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-17 16:50:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:53,915 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-17 16:50:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093109027] [2022-03-17 16:50:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093109027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:50:53,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:50:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:50:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884639216] [2022-03-17 16:50:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:53,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:50:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:50:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:50:53,919 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-17 16:50:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:54,017 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-03-17 16:50:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 16:50:54,017 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-17 16:50:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:54,018 INFO L225 Difference]: With dead ends: 32 [2022-03-17 16:50:54,019 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 16:50:54,019 INFO L911 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-17 16:50:54,020 INFO L912 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-17 16:50:54,021 INFO L913 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-17 16:50:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 16:50:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-17 16:50:54,026 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-17 16:50:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-03-17 16:50:54,027 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-03-17 16:50:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:54,028 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-03-17 16:50:54,028 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-17 16:50:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-03-17 16:50:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 16:50:54,029 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:54,029 INFO L500 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-17 16:50:54,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 16:50:54,029 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -793509026, now seen corresponding path program 1 times [2022-03-17 16:50:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:54,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791878369] [2022-03-17 16:50:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:54,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294514724] [2022-03-17 16:50:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:54,051 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-17 16:50:54,083 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-17 16:50:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:54,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 16:50:54,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:54,265 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-17 16:50:54,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:50:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791878369] [2022-03-17 16:50:54,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294514724] [2022-03-17 16:50:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294514724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:50:54,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:50:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:50:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053974730] [2022-03-17 16:50:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:54,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:50:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:50:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:50:54,269 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-17 16:50:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:54,317 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-03-17 16:50:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:50:54,317 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-17 16:50:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:54,318 INFO L225 Difference]: With dead ends: 47 [2022-03-17 16:50:54,318 INFO L226 Difference]: Without dead ends: 47 [2022-03-17 16:50:54,319 INFO L911 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-17 16:50:54,320 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:54,320 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:50:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-17 16:50:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-03-17 16:50:54,328 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-17 16:50:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-03-17 16:50:54,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-03-17 16:50:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:54,330 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-03-17 16:50:54,330 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-17 16:50:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-03-17 16:50:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-17 16:50:54,331 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:54,331 INFO L500 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-17 16:50:54,355 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-17 16:50:54,547 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-17 16:50:54,548 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2115229340, now seen corresponding path program 1 times [2022-03-17 16:50:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:54,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720752602] [2022-03-17 16:50:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:54,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:54,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758828810] [2022-03-17 16:50:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:54,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:54,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:54,568 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-17 16:50:54,593 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-17 16:50:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:54,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 16:50:54,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:54,799 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-17 16:50:54,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:50:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720752602] [2022-03-17 16:50:54,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758828810] [2022-03-17 16:50:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758828810] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:50:54,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:50:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-17 16:50:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545511699] [2022-03-17 16:50:54,864 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:50:54,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:50:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:50:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:50:54,866 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-17 16:50:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:54,976 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-03-17 16:50:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 16:50:54,977 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-17 16:50:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:54,980 INFO L225 Difference]: With dead ends: 51 [2022-03-17 16:50:54,980 INFO L226 Difference]: Without dead ends: 51 [2022-03-17 16:50:54,981 INFO L911 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-17 16:50:54,985 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:54,988 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 209 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:50:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-17 16:50:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-03-17 16:50:55,004 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-17 16:50:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-03-17 16:50:55,009 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-03-17 16:50:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:55,010 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-03-17 16:50:55,010 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-17 16:50:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-03-17 16:50:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-17 16:50:55,011 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:55,011 INFO L500 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-17 16:50:55,037 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-17 16:50:55,211 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-17 16:50:55,212 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -864241798, now seen corresponding path program 1 times [2022-03-17 16:50:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:55,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950270485] [2022-03-17 16:50:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:55,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:55,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495532991] [2022-03-17 16:50:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:55,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:55,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:55,226 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-17 16:50:55,234 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-17 16:50:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:55,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 16:50:55,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:55,437 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-17 16:50:55,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:50:55,538 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-17 16:50:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950270485] [2022-03-17 16:50:55,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495532991] [2022-03-17 16:50:55,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495532991] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 16:50:55,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:50:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-17 16:50:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184692670] [2022-03-17 16:50:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:55,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:50:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:50:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:50:55,540 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-17 16:50:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:55,590 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2022-03-17 16:50:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:50:55,590 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-17 16:50:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:55,593 INFO L225 Difference]: With dead ends: 73 [2022-03-17 16:50:55,593 INFO L226 Difference]: Without dead ends: 71 [2022-03-17 16:50:55,593 INFO L911 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-17 16:50:55,594 INFO L912 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-17 16:50:55,594 INFO L913 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-17 16:50:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-17 16:50:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-03-17 16:50:55,602 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-17 16:50:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-03-17 16:50:55,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-03-17 16:50:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:55,604 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-03-17 16:50:55,604 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-17 16:50:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-03-17 16:50:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-17 16:50:55,605 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:55,605 INFO L500 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-17 16:50:55,632 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-17 16:50:55,824 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-17 16:50:55,824 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -120478471, now seen corresponding path program 1 times [2022-03-17 16:50:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886620204] [2022-03-17 16:50:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:55,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236131371] [2022-03-17 16:50:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:55,838 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-17 16:50:55,846 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-17 16:50:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:55,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 16:50:55,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:55,942 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-17 16:50:55,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:50:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:55,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886620204] [2022-03-17 16:50:55,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:55,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236131371] [2022-03-17 16:50:55,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236131371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:50:55,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:50:55,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:50:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972366837] [2022-03-17 16:50:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:55,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:50:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:50:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:50:55,945 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-17 16:50:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:55,984 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-03-17 16:50:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:50:55,984 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-17 16:50:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:55,985 INFO L225 Difference]: With dead ends: 85 [2022-03-17 16:50:55,985 INFO L226 Difference]: Without dead ends: 85 [2022-03-17 16:50:55,986 INFO L911 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-17 16:50:55,986 INFO L912 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-17 16:50:55,987 INFO L913 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-17 16:50:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-03-17 16:50:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-03-17 16:50:55,994 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-17 16:50:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-03-17 16:50:55,995 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-03-17 16:50:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:55,995 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-03-17 16:50:55,996 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-17 16:50:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-03-17 16:50:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-17 16:50:55,997 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:55,997 INFO L500 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-17 16:50:56,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-17 16:50:56,210 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-17 16:50:56,211 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1628466672, now seen corresponding path program 1 times [2022-03-17 16:50:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722587325] [2022-03-17 16:50:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:56,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103494875] [2022-03-17 16:50:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:56,223 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-17 16:50:56,251 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-17 16:50:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:56,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:50:56,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:56,375 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-17 16:50:56,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:50:56,483 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-17 16:50:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722587325] [2022-03-17 16:50:56,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:56,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103494875] [2022-03-17 16:50:56,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103494875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:50:56,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:50:56,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-17 16:50:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885893107] [2022-03-17 16:50:56,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:50:56,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:50:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:50:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:50:56,485 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-17 16:50:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:56,584 INFO L93 Difference]: Finished difference Result 202 states and 256 transitions. [2022-03-17 16:50:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 16:50:56,585 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-17 16:50:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:56,586 INFO L225 Difference]: With dead ends: 202 [2022-03-17 16:50:56,587 INFO L226 Difference]: Without dead ends: 200 [2022-03-17 16:50:56,587 INFO L911 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-17 16:50:56,587 INFO L912 BasicCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:56,588 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:50:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-03-17 16:50:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-03-17 16:50:56,602 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-17 16:50:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2022-03-17 16:50:56,604 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 42 [2022-03-17 16:50:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:56,604 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2022-03-17 16:50:56,604 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-17 16:50:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2022-03-17 16:50:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-17 16:50:56,605 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:56,605 INFO L500 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-17 16:50:56,626 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-17 16:50:56,819 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-17 16:50:56,820 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1627394196, now seen corresponding path program 1 times [2022-03-17 16:50:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:56,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225651763] [2022-03-17 16:50:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:56,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:56,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352315262] [2022-03-17 16:50:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:56,831 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-17 16:50:56,849 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-17 16:50:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 16:50:56,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:57,015 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-17 16:50:57,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:50:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:57,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225651763] [2022-03-17 16:50:57,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:57,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352315262] [2022-03-17 16:50:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352315262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:50:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:50:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:50:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046214504] [2022-03-17 16:50:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:50:57,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:50:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:50:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:50:57,017 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-17 16:50:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:57,048 INFO L93 Difference]: Finished difference Result 206 states and 260 transitions. [2022-03-17 16:50:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:50:57,048 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-17 16:50:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:57,049 INFO L225 Difference]: With dead ends: 206 [2022-03-17 16:50:57,050 INFO L226 Difference]: Without dead ends: 203 [2022-03-17 16:50:57,050 INFO L911 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-17 16:50:57,050 INFO L912 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-17 16:50:57,051 INFO L913 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-17 16:50:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-03-17 16:50:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-03-17 16:50:57,062 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-17 16:50:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2022-03-17 16:50:57,064 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 42 [2022-03-17 16:50:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:57,064 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2022-03-17 16:50:57,065 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-17 16:50:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-03-17 16:50:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-17 16:50:57,066 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:57,066 INFO L500 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-17 16:50:57,091 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-17 16:50:57,289 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-17 16:50:57,289 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:57,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1527150038, now seen corresponding path program 1 times [2022-03-17 16:50:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:57,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366990619] [2022-03-17 16:50:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:57,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234846746] [2022-03-17 16:50:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:57,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:57,303 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-17 16:50:57,309 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-17 16:50:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 16:50:57,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:57,434 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-17 16:50:57,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:50:57,542 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-17 16:50:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:57,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366990619] [2022-03-17 16:50:57,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:57,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234846746] [2022-03-17 16:50:57,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234846746] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:50:57,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:50:57,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-17 16:50:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009927558] [2022-03-17 16:50:57,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:50:57,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:50:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:57,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:50:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:50:57,545 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-17 16:50:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:57,645 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2022-03-17 16:50:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 16:50:57,646 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-17 16:50:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:57,647 INFO L225 Difference]: With dead ends: 230 [2022-03-17 16:50:57,647 INFO L226 Difference]: Without dead ends: 216 [2022-03-17 16:50:57,647 INFO L911 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-17 16:50:57,648 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:57,648 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:50:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-03-17 16:50:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-03-17 16:50:57,657 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-17 16:50:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-03-17 16:50:57,659 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 44 [2022-03-17 16:50:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:57,659 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-03-17 16:50:57,659 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-17 16:50:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-03-17 16:50:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-17 16:50:57,660 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:57,660 INFO L500 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-17 16:50:57,690 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-17 16:50:57,887 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-17 16:50:57,887 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1237367986, now seen corresponding path program 2 times [2022-03-17 16:50:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:57,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003491005] [2022-03-17 16:50:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:57,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:57,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616965601] [2022-03-17 16:50:57,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:50:57,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:57,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:57,918 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-17 16:50:57,922 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-17 16:50:57,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:50:57,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:50:57,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-17 16:50:57,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:58,146 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-17 16:50:58,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:50:58,246 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-17 16:50:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:50:58,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003491005] [2022-03-17 16:50:58,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:50:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616965601] [2022-03-17 16:50:58,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616965601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:50:58,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:50:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-17 16:50:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786132618] [2022-03-17 16:50:58,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:50:58,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:50:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:50:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:50:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:50:58,248 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-17 16:50:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:50:59,399 INFO L93 Difference]: Finished difference Result 251 states and 310 transitions. [2022-03-17 16:50:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 16:50:59,399 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-17 16:50:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:50:59,401 INFO L225 Difference]: With dead ends: 251 [2022-03-17 16:50:59,401 INFO L226 Difference]: Without dead ends: 229 [2022-03-17 16:50:59,401 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:50:59,402 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:50:59,402 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 238 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-17 16:50:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-17 16:50:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2022-03-17 16:50:59,410 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-17 16:50:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2022-03-17 16:50:59,412 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 47 [2022-03-17 16:50:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:50:59,412 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2022-03-17 16:50:59,412 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-17 16:50:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2022-03-17 16:50:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-17 16:50:59,413 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:50:59,413 INFO L500 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-17 16:50:59,437 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-17 16:50:59,614 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-17 16:50:59,614 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:50:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:50:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -264996897, now seen corresponding path program 1 times [2022-03-17 16:50:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:50:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577653017] [2022-03-17 16:50:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:50:59,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:50:59,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731359913] [2022-03-17 16:50:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:50:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:50:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:50:59,626 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-17 16:50:59,650 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-17 16:50:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:50:59,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-17 16:50:59,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:50:59,899 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-17 16:50:59,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:51:00,026 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-17 16:51:00,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:51:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577653017] [2022-03-17 16:51:00,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:51:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731359913] [2022-03-17 16:51:00,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731359913] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 16:51:00,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:51:00,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-03-17 16:51:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087263900] [2022-03-17 16:51:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:51:00,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:51:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:51:00,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:51:00,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:51:00,028 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-17 16:51:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:51:00,053 INFO L93 Difference]: Finished difference Result 214 states and 242 transitions. [2022-03-17 16:51:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:51:00,053 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-17 16:51:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:51:00,055 INFO L225 Difference]: With dead ends: 214 [2022-03-17 16:51:00,055 INFO L226 Difference]: Without dead ends: 192 [2022-03-17 16:51:00,055 INFO L911 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-17 16:51:00,055 INFO L912 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-17 16:51:00,056 INFO L913 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-17 16:51:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-03-17 16:51:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-03-17 16:51:00,061 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-17 16:51:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2022-03-17 16:51:00,062 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 61 [2022-03-17 16:51:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:51:00,062 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2022-03-17 16:51:00,062 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-17 16:51:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2022-03-17 16:51:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-17 16:51:00,064 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:51:00,064 INFO L500 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-17 16:51:00,090 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-17 16:51:00,287 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-17 16:51:00,287 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:51:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:51:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1503864962, now seen corresponding path program 2 times [2022-03-17 16:51:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:51:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463735278] [2022-03-17 16:51:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:51:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:51:00,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:51:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771408764] [2022-03-17 16:51:00,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:51:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:51:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:51:00,299 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-17 16:51:00,301 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-17 16:51:00,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:51:00,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:51:00,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 16:51:00,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:51:00,545 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-17 16:51:00,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:51:00,752 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-17 16:51:00,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:51:00,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463735278] [2022-03-17 16:51:00,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:51:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771408764] [2022-03-17 16:51:00,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771408764] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:51:00,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:51:00,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-17 16:51:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672329997] [2022-03-17 16:51:00,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:51:00,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 16:51:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:51:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 16:51:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:51:00,754 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-17 16:51:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:51:00,978 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2022-03-17 16:51:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-17 16:51:00,978 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-17 16:51:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:51:00,981 INFO L225 Difference]: With dead ends: 507 [2022-03-17 16:51:00,981 INFO L226 Difference]: Without dead ends: 507 [2022-03-17 16:51:00,981 INFO L911 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-17 16:51:00,982 INFO L912 BasicCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:51:00,982 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 230 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:51:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-03-17 16:51:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2022-03-17 16:51:00,994 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-17 16:51:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 572 transitions. [2022-03-17 16:51:00,997 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 572 transitions. Word has length 99 [2022-03-17 16:51:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:51:00,997 INFO L478 AbstractCegarLoop]: Abstraction has 507 states and 572 transitions. [2022-03-17 16:51:00,998 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-17 16:51:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-03-17 16:51:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-03-17 16:51:01,001 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:51:01,001 INFO L500 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-17 16:51:01,030 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-17 16:51:01,219 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-17 16:51:01,219 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:51:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:51:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1084056642, now seen corresponding path program 3 times [2022-03-17 16:51:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:51:01,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581535291] [2022-03-17 16:51:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:51:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:51:01,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:51:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605089932] [2022-03-17 16:51:01,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:51:01,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:51:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:51:01,243 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-17 16:51:01,244 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-17 16:51:01,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-03-17 16:51:01,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:51:01,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-17 16:51:01,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:51:01,813 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-17 16:51:01,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:51:02,309 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-17 16:51:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:51:02,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581535291] [2022-03-17 16:51:02,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:51:02,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605089932] [2022-03-17 16:51:02,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605089932] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:51:02,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:51:02,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-17 16:51:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279861752] [2022-03-17 16:51:02,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:51:02,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-17 16:51:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:51:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-17 16:51:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-17 16:51:02,312 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-17 16:51:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:51:02,806 INFO L93 Difference]: Finished difference Result 1037 states and 1172 transitions. [2022-03-17 16:51:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-17 16:51:02,807 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-17 16:51:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:51:02,812 INFO L225 Difference]: With dead ends: 1037 [2022-03-17 16:51:02,812 INFO L226 Difference]: Without dead ends: 1037 [2022-03-17 16:51:02,813 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-03-17 16:51:02,813 INFO L912 BasicCegarLoop]: 89 mSDtfsCounter, 230 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 16:51:02,814 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 330 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 16:51:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-03-17 16:51:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2022-03-17 16:51:02,834 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-17 16:51:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1172 transitions. [2022-03-17 16:51:02,838 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1172 transitions. Word has length 213 [2022-03-17 16:51:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:51:02,839 INFO L478 AbstractCegarLoop]: Abstraction has 1037 states and 1172 transitions. [2022-03-17 16:51:02,839 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-17 16:51:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1172 transitions. [2022-03-17 16:51:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-03-17 16:51:02,846 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:51:02,846 INFO L500 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-17 16:51:02,872 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-17 16:51:03,063 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-17 16:51:03,063 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:51:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:51:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2008789634, now seen corresponding path program 4 times [2022-03-17 16:51:03,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:51:03,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778598186] [2022-03-17 16:51:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:51:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:51:03,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:51:03,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188692466] [2022-03-17 16:51:03,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 16:51:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:51:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:51:03,084 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-17 16:51:03,109 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-17 16:51:03,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 16:51:03,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-17 16:51:03,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-17 16:51:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-17 16:51:03,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-17 16:51:03,560 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-17 16:51:03,561 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-17 16:51:03,589 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-17 16:51:03,783 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-17 16:51:03,786 INFO L718 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:51:03,789 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 16:51:03,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:51:03 BasicIcfg [2022-03-17 16:51:03,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 16:51:03,917 INFO L158 Benchmark]: Toolchain (without parser) took 11167.49ms. Allocated memory was 183.5MB in the beginning and 306.2MB in the end (delta: 122.7MB). Free memory was 128.1MB in the beginning and 228.5MB in the end (delta: -100.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,917 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 16:51:03,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.39ms. Allocated memory was 183.5MB in the beginning and 254.8MB in the end (delta: 71.3MB). Free memory was 128.0MB in the beginning and 226.6MB in the end (delta: -98.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,918 INFO L158 Benchmark]: Boogie Preprocessor took 35.23ms. Allocated memory is still 254.8MB. Free memory was 226.6MB in the beginning and 225.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,918 INFO L158 Benchmark]: RCFGBuilder took 235.23ms. Allocated memory is still 254.8MB. Free memory was 225.1MB in the beginning and 213.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,919 INFO L158 Benchmark]: IcfgTransformer took 20.22ms. Allocated memory is still 254.8MB. Free memory was 213.5MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,919 INFO L158 Benchmark]: TraceAbstraction took 10610.95ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 211.4MB in the beginning and 228.5MB in the end (delta: -17.1MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-03-17 16:51:03,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.39ms. Allocated memory was 183.5MB in the beginning and 254.8MB in the end (delta: 71.3MB). Free memory was 128.0MB in the beginning and 226.6MB in the end (delta: -98.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.23ms. Allocated memory is still 254.8MB. Free memory was 226.6MB in the beginning and 225.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.23ms. Allocated memory is still 254.8MB. Free memory was 225.1MB in the beginning and 213.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 20.22ms. Allocated memory is still 254.8MB. Free memory was 213.5MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10610.95ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 211.4MB in the beginning and 228.5MB in the end (delta: -17.1MB). Peak memory consumption was 35.8MB. 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: 10.4s, OverallIterations: 14, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 531 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 498 mSDsluCounter, 2146 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1554 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 981 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 592 mSDtfsCounter, 981 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.9s 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s 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-17 16:51:03,937 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...