/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/cohencu-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 16:13:47,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 16:13:47,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 16:13:47,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 16:13:47,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 16:13:47,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 16:13:47,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 16:13:47,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 16:13:47,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 16:13:47,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 16:13:47,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 16:13:47,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 16:13:47,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 16:13:47,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 16:13:47,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 16:13:47,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 16:13:47,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 16:13:47,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 16:13:47,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 16:13:47,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 16:13:47,722 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 16:13:47,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 16:13:47,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 16:13:47,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 16:13:47,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 16:13:47,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 16:13:47,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 16:13:47,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 16:13:47,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 16:13:47,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 16:13:47,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 16:13:47,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 16:13:47,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 16:13:47,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 16:13:47,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 16:13:47,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 16:13:47,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 16:13:47,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 16:13:47,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 16:13:47,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 16:13:47,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 16:13:47,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 16:13:47,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 16:13:47,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 16:13:47,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 16:13:47,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 16:13:47,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 16:13:47,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:13:47,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 16:13:47,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 16:13:47,744 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 16:13:47,744 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:13:47,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 16:13:47,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 16:13:47,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 16:13:47,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 16:13:47,932 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 16:13:47,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-17 16:13:47,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6ae49e2/a2a57fa91e44434d835051c31ae667db/FLAG4f64a7475 [2022-03-17 16:13:48,303 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 16:13:48,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-17 16:13:48,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6ae49e2/a2a57fa91e44434d835051c31ae667db/FLAG4f64a7475 [2022-03-17 16:13:48,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6ae49e2/a2a57fa91e44434d835051c31ae667db [2022-03-17 16:13:48,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 16:13:48,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 16:13:48,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 16:13:48,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 16:13:48,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 16:13:48,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b6401d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48, skipping insertion in model container [2022-03-17 16:13:48,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 16:13:48,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 16:13:48,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2022-03-17 16:13:48,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:13:48,940 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 16:13:48,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2022-03-17 16:13:48,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:13:48,970 INFO L208 MainTranslator]: Completed translation [2022-03-17 16:13:48,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48 WrapperNode [2022-03-17 16:13:48,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 16:13:48,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 16:13:48,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 16:13:48,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 16:13:48,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:48,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:49,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:49,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 16:13:49,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 16:13:49,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 16:13:49,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 16:13:49,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (1/1) ... [2022-03-17 16:13:49,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:13:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:49,032 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:13:49,050 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:13:49,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 16:13:49,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 16:13:49,065 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 16:13:49,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 16:13:49,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 16:13:49,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 16:13:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 16:13:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 16:13:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 16:13:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 16:13:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-03-17 16:13:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 16:13:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 16:13:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 16:13:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 16:13:49,114 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 16:13:49,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 16:13:49,225 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 16:13:49,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 16:13:49,229 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 16:13:49,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:13:49 BoogieIcfgContainer [2022-03-17 16:13:49,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 16:13:49,230 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 16:13:49,230 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 16:13:49,231 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 16:13:49,233 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:13:49" (1/1) ... [2022-03-17 16:13:49,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:13:49 BasicIcfg [2022-03-17 16:13:49,245 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 16:13:49,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 16:13:49,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 16:13:49,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 16:13:49,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:13:48" (1/4) ... [2022-03-17 16:13:49,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56aa1bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:13:49, skipping insertion in model container [2022-03-17 16:13:49,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:13:48" (2/4) ... [2022-03-17 16:13:49,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56aa1bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:13:49, skipping insertion in model container [2022-03-17 16:13:49,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:13:49" (3/4) ... [2022-03-17 16:13:49,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56aa1bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:13:49, skipping insertion in model container [2022-03-17 16:13:49,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:13:49" (4/4) ... [2022-03-17 16:13:49,250 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.cJordan [2022-03-17 16:13:49,253 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 16:13:49,253 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 16:13:49,301 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 16:13:49,306 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:13:49,306 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 16:13:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-17 16:13:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 16:13:49,320 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:49,320 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:49,321 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-03-17 16:13:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876041985] [2022-03-17 16:13:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 16:13:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 16:13:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:49,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876041985] [2022-03-17 16:13:49,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876041985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:49,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:49,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 16:13:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489740502] [2022-03-17 16:13:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:49,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 16:13:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 16:13:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 16:13:49,521 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:49,610 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-03-17 16:13:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 16:13:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-17 16:13:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:49,621 INFO L225 Difference]: With dead ends: 32 [2022-03-17 16:13:49,621 INFO L226 Difference]: Without dead ends: 27 [2022-03-17 16:13:49,622 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 16:13:49,628 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:49,629 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-17 16:13:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-03-17 16:13:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-17 16:13:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-03-17 16:13:49,659 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-03-17 16:13:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:49,659 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-03-17 16:13:49,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-03-17 16:13:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-17 16:13:49,660 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:49,661 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:49,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 16:13:49,661 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-03-17 16:13:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:49,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320653300] [2022-03-17 16:13:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 16:13:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 16:13:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:49,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320653300] [2022-03-17 16:13:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320653300] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 16:13:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491127863] [2022-03-17 16:13:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:49,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:13:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:13:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:13:49,762 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:49,846 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-03-17 16:13:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 16:13:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-17 16:13:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:49,849 INFO L225 Difference]: With dead ends: 28 [2022-03-17 16:13:49,849 INFO L226 Difference]: Without dead ends: 28 [2022-03-17 16:13:49,849 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-17 16:13:49,850 INFO L912 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:49,850 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-17 16:13:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-17 16:13:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-17 16:13:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-03-17 16:13:49,855 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-03-17 16:13:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:49,855 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-03-17 16:13:49,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-03-17 16:13:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-17 16:13:49,855 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:49,855 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:49,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 16:13:49,856 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-03-17 16:13:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:49,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717969724] [2022-03-17 16:13:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 16:13:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 16:13:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:49,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717969724] [2022-03-17 16:13:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717969724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:49,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:49,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 16:13:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336768467] [2022-03-17 16:13:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:49,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 16:13:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 16:13:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 16:13:49,961 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:50,077 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-03-17 16:13:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 16:13:50,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-17 16:13:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:50,080 INFO L225 Difference]: With dead ends: 32 [2022-03-17 16:13:50,080 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 16:13:50,080 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:13:50,081 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:50,082 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 16:13:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-17 16:13:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-17 16:13:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-03-17 16:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-03-17 16:13:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:50,088 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-03-17 16:13:50,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 16:13:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-03-17 16:13:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 16:13:50,088 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:50,088 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:50,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 16:13:50,089 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-03-17 16:13:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643644259] [2022-03-17 16:13:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:50,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:50,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294490773] [2022-03-17 16:13:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:50,108 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:13:50,110 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:13:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:50,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:13:50,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 16:13:50,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:13:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643644259] [2022-03-17 16:13:50,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294490773] [2022-03-17 16:13:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294490773] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:13:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323165790] [2022-03-17 16:13:50,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:50,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:13:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:13:50,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:13:50,262 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-17 16:13:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:50,298 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-03-17 16:13:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:13:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-03-17 16:13:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:50,300 INFO L225 Difference]: With dead ends: 48 [2022-03-17 16:13:50,300 INFO L226 Difference]: Without dead ends: 48 [2022-03-17 16:13:50,300 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-17 16:13:50,302 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:50,303 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:13:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-17 16:13:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-03-17 16:13:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-17 16:13:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-03-17 16:13:50,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-03-17 16:13:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:50,308 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-03-17 16:13:50,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-17 16:13:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-03-17 16:13:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-17 16:13:50,309 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:50,309 INFO L500 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:50,328 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:13:50,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:50,510 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-03-17 16:13:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:50,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925915530] [2022-03-17 16:13:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:50,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095909850] [2022-03-17 16:13:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:50,521 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:13:50,522 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:13:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:50,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:13:50,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 16:13:50,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:13:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925915530] [2022-03-17 16:13:50,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095909850] [2022-03-17 16:13:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095909850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:13:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363338223] [2022-03-17 16:13:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:50,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:13:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:13:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:13:50,620 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-17 16:13:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:50,649 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-03-17 16:13:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:13:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-03-17 16:13:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:50,650 INFO L225 Difference]: With dead ends: 52 [2022-03-17 16:13:50,650 INFO L226 Difference]: Without dead ends: 52 [2022-03-17 16:13:50,650 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-17 16:13:50,651 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:50,651 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:13:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-17 16:13:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-03-17 16:13:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-17 16:13:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-03-17 16:13:50,686 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-03-17 16:13:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:50,686 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-03-17 16:13:50,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-17 16:13:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-03-17 16:13:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-17 16:13:50,687 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:50,687 INFO L500 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:50,703 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:13:50,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:50,890 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-03-17 16:13:50,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:50,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950083980] [2022-03-17 16:13:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:50,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:50,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886260720] [2022-03-17 16:13:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:50,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:50,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:50,898 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:13:50,901 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:13:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:50,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 16:13:50,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-17 16:13:51,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:13:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950083980] [2022-03-17 16:13:51,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886260720] [2022-03-17 16:13:51,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886260720] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:13:51,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:13:51,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:13:51,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647424336] [2022-03-17 16:13:51,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:13:51,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:13:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:13:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:13:51,048 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-17 16:13:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:51,099 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-03-17 16:13:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:13:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-03-17 16:13:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:51,100 INFO L225 Difference]: With dead ends: 60 [2022-03-17 16:13:51,100 INFO L226 Difference]: Without dead ends: 50 [2022-03-17 16:13:51,100 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-17 16:13:51,101 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:51,101 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:13:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-17 16:13:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-17 16:13:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-17 16:13:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-03-17 16:13:51,106 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-03-17 16:13:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:51,106 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-03-17 16:13:51,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-17 16:13:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-03-17 16:13:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-17 16:13:51,107 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:51,107 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:51,130 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:13:51,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:51,324 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-03-17 16:13:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822486709] [2022-03-17 16:13:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:51,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710847055] [2022-03-17 16:13:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:51,332 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:13:51,333 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:13:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:51,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:13:51,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-17 16:13:51,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-17 16:13:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:51,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822486709] [2022-03-17 16:13:51,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:51,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710847055] [2022-03-17 16:13:51,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710847055] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:51,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:51,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-17 16:13:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769020913] [2022-03-17 16:13:51,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:51,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:13:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:13:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:13:51,563 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-17 16:13:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:51,696 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-03-17 16:13:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 16:13:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-03-17 16:13:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:51,701 INFO L225 Difference]: With dead ends: 104 [2022-03-17 16:13:51,701 INFO L226 Difference]: Without dead ends: 104 [2022-03-17 16:13:51,701 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:13:51,702 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:51,702 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 191 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-17 16:13:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-03-17 16:13:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-17 16:13:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-03-17 16:13:51,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-03-17 16:13:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:51,711 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-03-17 16:13:51,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-17 16:13:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-03-17 16:13:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-17 16:13:51,712 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:51,712 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:51,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-17 16:13:51,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:51,915 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-03-17 16:13:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:51,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655959920] [2022-03-17 16:13:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:51,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371738997] [2022-03-17 16:13:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:51,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:51,932 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:13:51,933 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:13:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:51,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 16:13:51,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-17 16:13:52,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-17 16:13:52,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655959920] [2022-03-17 16:13:52,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371738997] [2022-03-17 16:13:52,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371738997] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:52,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:52,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-17 16:13:52,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628258468] [2022-03-17 16:13:52,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:52,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:13:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:13:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:13:52,253 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-17 16:13:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:52,464 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-03-17 16:13:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 16:13:52,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-03-17 16:13:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:52,465 INFO L225 Difference]: With dead ends: 116 [2022-03-17 16:13:52,465 INFO L226 Difference]: Without dead ends: 116 [2022-03-17 16:13:52,465 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:13:52,466 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:52,466 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 16:13:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-17 16:13:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-03-17 16:13:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-17 16:13:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-03-17 16:13:52,473 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-03-17 16:13:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:52,473 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-03-17 16:13:52,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-17 16:13:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-03-17 16:13:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-17 16:13:52,474 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:52,474 INFO L500 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:52,492 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:13:52,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:52,690 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-03-17 16:13:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:52,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909388193] [2022-03-17 16:13:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:52,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410291620] [2022-03-17 16:13:52,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:13:52,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:52,699 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:13:52,699 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:13:52,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:13:52,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:13:52,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 16:13:52,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-17 16:13:52,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-17 16:13:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909388193] [2022-03-17 16:13:52,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410291620] [2022-03-17 16:13:52,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410291620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:52,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:52,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-17 16:13:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796024241] [2022-03-17 16:13:52,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:52,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:13:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:13:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:13:52,944 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-17 16:13:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:53,008 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-03-17 16:13:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 16:13:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-03-17 16:13:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:53,009 INFO L225 Difference]: With dead ends: 120 [2022-03-17 16:13:53,009 INFO L226 Difference]: Without dead ends: 120 [2022-03-17 16:13:53,010 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:13:53,010 INFO L912 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:53,010 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-03-17 16:13:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-03-17 16:13:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-17 16:13:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-03-17 16:13:53,017 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-03-17 16:13:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:53,017 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-03-17 16:13:53,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-17 16:13:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-03-17 16:13:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-17 16:13:53,018 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:53,018 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:53,049 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:13:53,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:53,237 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:53,237 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-03-17 16:13:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:53,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192323581] [2022-03-17 16:13:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:53,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:53,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442813924] [2022-03-17 16:13:53,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:13:53,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:53,245 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:13:53,246 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:13:53,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-17 16:13:53,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:13:53,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-17 16:13:53,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-17 16:13:53,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-17 16:13:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192323581] [2022-03-17 16:13:53,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442813924] [2022-03-17 16:13:53,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442813924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:53,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:53,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-17 16:13:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906105288] [2022-03-17 16:13:53,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:53,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:13:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:53,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:13:53,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-17 16:13:53,700 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-17 16:13:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:53,915 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2022-03-17 16:13:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 16:13:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-03-17 16:13:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:53,916 INFO L225 Difference]: With dead ends: 144 [2022-03-17 16:13:53,916 INFO L226 Difference]: Without dead ends: 135 [2022-03-17 16:13:53,916 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:13:53,917 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:53,917 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 16:13:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-03-17 16:13:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-03-17 16:13:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-17 16:13:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-03-17 16:13:53,922 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-03-17 16:13:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:53,922 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-03-17 16:13:53,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-17 16:13:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-03-17 16:13:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-17 16:13:53,923 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:53,924 INFO L500 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:53,950 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:13:54,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:54,135 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-03-17 16:13:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:54,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015698906] [2022-03-17 16:13:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:54,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:54,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282026443] [2022-03-17 16:13:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:54,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:54,143 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:13:54,144 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:13:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:54,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-17 16:13:54,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-17 16:13:54,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-17 16:13:55,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:55,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015698906] [2022-03-17 16:13:55,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:55,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282026443] [2022-03-17 16:13:55,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282026443] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:55,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:55,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-17 16:13:55,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557580627] [2022-03-17 16:13:55,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:55,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 16:13:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:55,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 16:13:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:13:55,005 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-17 16:13:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:55,263 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-03-17 16:13:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 16:13:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-03-17 16:13:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:55,265 INFO L225 Difference]: With dead ends: 146 [2022-03-17 16:13:55,265 INFO L226 Difference]: Without dead ends: 144 [2022-03-17 16:13:55,265 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:13:55,265 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:55,265 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-17 16:13:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-03-17 16:13:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-17 16:13:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-03-17 16:13:55,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-03-17 16:13:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:55,270 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-03-17 16:13:55,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-17 16:13:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-03-17 16:13:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-17 16:13:55,271 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:55,272 INFO L500 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:55,291 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:13:55,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-17 16:13:55,488 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-03-17 16:13:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590302040] [2022-03-17 16:13:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:55,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:55,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278462393] [2022-03-17 16:13:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:55,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:55,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:55,496 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:13:55,497 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:13:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:13:55,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-17 16:13:55,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-03-17 16:13:55,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:55,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590302040] [2022-03-17 16:13:55,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:55,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278462393] [2022-03-17 16:13:55,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278462393] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:13:55,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:13:55,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-03-17 16:13:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589220271] [2022-03-17 16:13:55,920 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:55,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 16:13:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 16:13:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:13:55,921 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-17 16:13:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:55,994 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-03-17 16:13:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 16:13:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-03-17 16:13:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:55,996 INFO L225 Difference]: With dead ends: 141 [2022-03-17 16:13:55,996 INFO L226 Difference]: Without dead ends: 132 [2022-03-17 16:13:55,996 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-17 16:13:55,997 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:55,997 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-17 16:13:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-03-17 16:13:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-17 16:13:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-03-17 16:13:56,004 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-03-17 16:13:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:56,004 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-03-17 16:13:56,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-17 16:13:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-03-17 16:13:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-17 16:13:56,008 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:56,008 INFO L500 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:56,032 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:13:56,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:56,224 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-03-17 16:13:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813594737] [2022-03-17 16:13:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:56,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:56,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166366494] [2022-03-17 16:13:56,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 16:13:56,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:56,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:56,231 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:13:56,242 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:13:58,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 16:13:58,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:13:58,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-17 16:13:58,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-03-17 16:13:58,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:13:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-03-17 16:13:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:13:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813594737] [2022-03-17 16:13:59,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:13:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166366494] [2022-03-17 16:13:59,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166366494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:13:59,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:13:59,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-03-17 16:13:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310520310] [2022-03-17 16:13:59,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:13:59,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 16:13:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:13:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 16:13:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:13:59,252 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-17 16:13:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:13:59,351 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-03-17 16:13:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 16:13:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-03-17 16:13:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:13:59,352 INFO L225 Difference]: With dead ends: 140 [2022-03-17 16:13:59,352 INFO L226 Difference]: Without dead ends: 138 [2022-03-17 16:13:59,352 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-17 16:13:59,353 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:13:59,353 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:13:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-17 16:13:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-03-17 16:13:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-17 16:13:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-03-17 16:13:59,357 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-03-17 16:13:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:13:59,358 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-03-17 16:13:59,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-17 16:13:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-03-17 16:13:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-17 16:13:59,359 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:13:59,359 INFO L500 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:13:59,375 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:13:59,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-17 16:13:59,565 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:13:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:13:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-03-17 16:13:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:13:59,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808281336] [2022-03-17 16:13:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:13:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:13:59,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:13:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586806749] [2022-03-17 16:13:59,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:13:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:13:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:13:59,580 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:13:59,580 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:13:59,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:13:59,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:13:59,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-17 16:13:59,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:13:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-03-17 16:13:59,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:14:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:14:00,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808281336] [2022-03-17 16:14:00,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:14:00,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586806749] [2022-03-17 16:14:00,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586806749] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:14:00,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:14:00,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-17 16:14:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143401556] [2022-03-17 16:14:00,121 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:14:00,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 16:14:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:14:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 16:14:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:14:00,122 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:14:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:14:00,227 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-03-17 16:14:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 16:14:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-03-17 16:14:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:14:00,228 INFO L225 Difference]: With dead ends: 138 [2022-03-17 16:14:00,229 INFO L226 Difference]: Without dead ends: 129 [2022-03-17 16:14:00,229 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-17 16:14:00,229 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:14:00,229 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:14:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-17 16:14:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-03-17 16:14:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-17 16:14:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-03-17 16:14:00,232 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-03-17 16:14:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:14:00,232 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-03-17 16:14:00,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:14:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-03-17 16:14:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-03-17 16:14:00,233 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:14:00,233 INFO L500 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:14:00,250 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:14:00,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 16:14:00,439 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:14:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:14:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-03-17 16:14:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:14:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854243199] [2022-03-17 16:14:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:14:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:14:00,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:14:00,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44928130] [2022-03-17 16:14:00,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:14:00,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:00,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:14:00,449 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:14:00,450 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:14:00,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:14:00,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:14:00,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-17 16:14:00,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:14:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-17 16:14:00,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:14:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:14:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854243199] [2022-03-17 16:14:01,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:14:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44928130] [2022-03-17 16:14:01,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44928130] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:14:01,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:14:01,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-17 16:14:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870514500] [2022-03-17 16:14:01,154 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:14:01,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:14:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:14:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:14:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-17 16:14:01,155 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-17 16:14:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:14:01,326 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-03-17 16:14:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 16:14:01,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-03-17 16:14:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:14:01,327 INFO L225 Difference]: With dead ends: 150 [2022-03-17 16:14:01,327 INFO L226 Difference]: Without dead ends: 150 [2022-03-17 16:14:01,327 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:14:01,328 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:14:01,328 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:14:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-17 16:14:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-03-17 16:14:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-03-17 16:14:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-03-17 16:14:01,331 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-03-17 16:14:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:14:01,332 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-03-17 16:14:01,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-17 16:14:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-03-17 16:14:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-03-17 16:14:01,332 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:14:01,332 INFO L500 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:14:01,354 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:14:01,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-17 16:14:01,552 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:14:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:14:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-03-17 16:14:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:14:01,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758109755] [2022-03-17 16:14:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:14:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:14:01,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:14:01,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028622676] [2022-03-17 16:14:01,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:14:01,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:01,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:14:01,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:14:01,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 16:14:01,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:14:01,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:14:01,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 16:14:01,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:14:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-03-17 16:14:01,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:14:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-17 16:14:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:14:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758109755] [2022-03-17 16:14:02,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:14:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028622676] [2022-03-17 16:14:02,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028622676] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:14:02,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:14:02,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-17 16:14:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307386431] [2022-03-17 16:14:02,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:14:02,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 16:14:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:14:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 16:14:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:14:02,022 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-17 16:14:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:14:02,316 INFO L93 Difference]: Finished difference Result 355 states and 369 transitions. [2022-03-17 16:14:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-17 16:14:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-03-17 16:14:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:14:02,317 INFO L225 Difference]: With dead ends: 355 [2022-03-17 16:14:02,318 INFO L226 Difference]: Without dead ends: 353 [2022-03-17 16:14:02,318 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-03-17 16:14:02,318 INFO L912 BasicCegarLoop]: 86 mSDtfsCounter, 148 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:14:02,318 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 370 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 16:14:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-03-17 16:14:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-03-17 16:14:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-17 16:14:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-03-17 16:14:02,325 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-03-17 16:14:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:14:02,326 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-03-17 16:14:02,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-17 16:14:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-03-17 16:14:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-17 16:14:02,327 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:14:02,327 INFO L500 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:14:02,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-17 16:14:02,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-17 16:14:02,527 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:14:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:14:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-03-17 16:14:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:14:02,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050898884] [2022-03-17 16:14:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:14:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:14:02,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:14:02,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788947219] [2022-03-17 16:14:02,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:14:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:14:02,535 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:14:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-17 16:14:03,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-17 16:14:03,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:14:03,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-17 16:14:03,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:14:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-03-17 16:14:03,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:14:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:14:03,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050898884] [2022-03-17 16:14:03,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:14:03,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788947219] [2022-03-17 16:14:03,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788947219] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:14:03,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:14:03,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-17 16:14:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199527097] [2022-03-17 16:14:03,535 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:14:03,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:14:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:14:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:14:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-17 16:14:03,536 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-17 16:14:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:14:03,670 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-03-17 16:14:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 16:14:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-03-17 16:14:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:14:03,673 INFO L225 Difference]: With dead ends: 311 [2022-03-17 16:14:03,673 INFO L226 Difference]: Without dead ends: 302 [2022-03-17 16:14:03,673 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:14:03,673 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:14:03,674 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 372 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:14:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-03-17 16:14:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-03-17 16:14:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-03-17 16:14:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-03-17 16:14:03,680 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-03-17 16:14:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:14:03,680 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-03-17 16:14:03,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-17 16:14:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-03-17 16:14:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-17 16:14:03,682 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:14:03,682 INFO L500 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:14:03,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-17 16:14:03,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:03,887 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:14:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:14:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-03-17 16:14:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:14:03,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634036643] [2022-03-17 16:14:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:14:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:14:03,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:14:03,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266362308] [2022-03-17 16:14:03,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:14:03,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:14:03,895 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:14:03,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-17 16:14:04,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-17 16:14:04,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:14:04,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 16:14:04,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:14:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-03-17 16:14:04,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:14:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:14:06,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634036643] [2022-03-17 16:14:06,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:14:06,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266362308] [2022-03-17 16:14:06,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266362308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:14:06,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:14:06,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-17 16:14:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836507129] [2022-03-17 16:14:06,625 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:14:06,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:14:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:14:06,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:14:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-03-17 16:14:06,626 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-17 16:14:08,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:14:10,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:14:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:14:10,676 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-03-17 16:14:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 16:14:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-03-17 16:14:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:14:10,677 INFO L225 Difference]: With dead ends: 309 [2022-03-17 16:14:10,677 INFO L226 Difference]: Without dead ends: 309 [2022-03-17 16:14:10,677 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-03-17 16:14:10,678 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:14:10,678 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-03-17 16:14:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-03-17 16:14:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-03-17 16:14:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-17 16:14:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-03-17 16:14:10,684 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-03-17 16:14:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:14:10,684 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-03-17 16:14:10,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-17 16:14:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-03-17 16:14:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-17 16:14:10,685 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:14:10,685 INFO L500 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:14:10,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-17 16:14:10,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-17 16:14:10,890 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:14:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:14:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-03-17 16:14:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:14:10,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758503745] [2022-03-17 16:14:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:14:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:14:10,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:14:10,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141148704] [2022-03-17 16:14:10,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 16:14:10,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:14:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:14:10,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:14:10,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-17 16:14:12,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 16:14:12,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:14:12,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-17 16:14:12,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:15:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-03-17 16:15:30,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:15:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-03-17 16:15:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:15:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758503745] [2022-03-17 16:15:33,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:15:33,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141148704] [2022-03-17 16:15:33,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141148704] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:15:33,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:15:33,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-03-17 16:15:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968334727] [2022-03-17 16:15:33,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:15:33,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 16:15:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:15:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 16:15:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=240, Unknown=3, NotChecked=0, Total=306 [2022-03-17 16:15:33,597 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-17 16:15:35,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:15:37,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:15:40,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:15:50,775 WARN L232 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:15:53,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:15:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:15:58,173 INFO L93 Difference]: Finished difference Result 313 states and 326 transitions. [2022-03-17 16:15:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 16:15:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-03-17 16:15:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:15:58,175 INFO L225 Difference]: With dead ends: 313 [2022-03-17 16:15:58,175 INFO L226 Difference]: Without dead ends: 294 [2022-03-17 16:15:58,175 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=139, Invalid=455, Unknown=6, NotChecked=0, Total=600 [2022-03-17 16:15:58,176 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 70 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:15:58,176 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 10.0s Time] [2022-03-17 16:15:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-17 16:15:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-03-17 16:15:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-03-17 16:15:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-03-17 16:15:58,180 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-03-17 16:15:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:15:58,181 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-03-17 16:15:58,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-17 16:15:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-03-17 16:15:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-03-17 16:15:58,183 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:15:58,183 INFO L500 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:15:58,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-17 16:15:58,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:15:58,389 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:15:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:15:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-03-17 16:15:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:15:58,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105850183] [2022-03-17 16:15:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:15:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:15:58,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:15:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442900518] [2022-03-17 16:15:58,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:15:58,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:15:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:15:58,398 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:15:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-17 16:15:58,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-03-17 16:15:58,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:15:58,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-17 16:15:58,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:15:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-03-17 16:15:59,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:15:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-03-17 16:15:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:15:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105850183] [2022-03-17 16:15:59,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:15:59,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442900518] [2022-03-17 16:15:59,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442900518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:15:59,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:15:59,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-17 16:15:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103754246] [2022-03-17 16:15:59,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:15:59,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-17 16:15:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:15:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-17 16:15:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-17 16:15:59,662 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-17 16:16:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:16:00,178 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-03-17 16:16:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-17 16:16:00,178 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-03-17 16:16:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:16:00,180 INFO L225 Difference]: With dead ends: 574 [2022-03-17 16:16:00,180 INFO L226 Difference]: Without dead ends: 574 [2022-03-17 16:16:00,181 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-03-17 16:16:00,181 INFO L912 BasicCegarLoop]: 121 mSDtfsCounter, 162 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 16:16:00,181 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 482 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 16:16:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-03-17 16:16:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-03-17 16:16:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-03-17 16:16:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2022-03-17 16:16:00,190 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 297 [2022-03-17 16:16:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:16:00,191 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2022-03-17 16:16:00,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-17 16:16:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-03-17 16:16:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-03-17 16:16:00,198 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:16:00,199 INFO L500 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:16:00,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-17 16:16:00,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:16:00,404 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:16:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:16:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1448321483, now seen corresponding path program 4 times [2022-03-17 16:16:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:16:00,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833914092] [2022-03-17 16:16:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:16:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:16:00,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:16:00,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487371885] [2022-03-17 16:16:00,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 16:16:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:16:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:16:00,432 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:16:00,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-17 16:16:00,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 16:16:00,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-17 16:16:00,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-17 16:16:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-17 16:16:01,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-17 16:16:01,168 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-17 16:16:01,168 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-17 16:16:01,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-17 16:16:01,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:16:01,379 INFO L718 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-17 16:16:01,381 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 16:16:01,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:16:01 BasicIcfg [2022-03-17 16:16:01,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 16:16:01,491 INFO L158 Benchmark]: Toolchain (without parser) took 132724.82ms. Allocated memory was 176.2MB in the beginning and 215.0MB in the end (delta: 38.8MB). Free memory was 127.1MB in the beginning and 130.9MB in the end (delta: -3.8MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,491 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 16:16:01,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.58ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 151.7MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,494 INFO L158 Benchmark]: Boogie Preprocessor took 33.33ms. Allocated memory is still 176.2MB. Free memory was 151.7MB in the beginning and 150.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,494 INFO L158 Benchmark]: RCFGBuilder took 224.71ms. Allocated memory is still 176.2MB. Free memory was 150.2MB in the beginning and 139.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,494 INFO L158 Benchmark]: IcfgTransformer took 14.76ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 138.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,495 INFO L158 Benchmark]: TraceAbstraction took 132244.92ms. Allocated memory was 176.2MB in the beginning and 215.0MB in the end (delta: 38.8MB). Free memory was 137.7MB in the beginning and 130.9MB in the end (delta: 6.8MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2022-03-17 16:16:01,498 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.08ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.58ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 151.7MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.33ms. Allocated memory is still 176.2MB. Free memory was 151.7MB in the beginning and 150.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.71ms. Allocated memory is still 176.2MB. Free memory was 150.2MB in the beginning and 139.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 14.76ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 138.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 132244.92ms. Allocated memory was 176.2MB in the beginning and 215.0MB in the end (delta: 38.8MB). Free memory was 137.7MB in the beginning and 130.9MB in the end (delta: 6.8MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=26, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 132.1s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 607 SdHoareTripleChecker+Valid, 16.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 4261 SdHoareTripleChecker+Invalid, 15.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3286 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2402 IncrementalHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 975 mSDtfsCounter, 2402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2766 GetRequests, 2521 SyntacticMatches, 20 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 89.7s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10620 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 15720/22306 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:16:01,527 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...