/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 13:32:22,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 13:32:22,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 13:32:23,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 13:32:23,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 13:32:23,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 13:32:23,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 13:32:23,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 13:32:23,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 13:32:23,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 13:32:23,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 13:32:23,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 13:32:23,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 13:32:23,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 13:32:23,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 13:32:23,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 13:32:23,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 13:32:23,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 13:32:23,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 13:32:23,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 13:32:23,044 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 13:32:23,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 13:32:23,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 13:32:23,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 13:32:23,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 13:32:23,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 13:32:23,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 13:32:23,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 13:32:23,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 13:32:23,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 13:32:23,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 13:32:23,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 13:32:23,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 13:32:23,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 13:32:23,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 13:32:23,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 13:32:23,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 13:32:23,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 13:32:23,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 13:32:23,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 13:32:23,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 13:32:23,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 13:32:23,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-18 13:32:23,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 13:32:23,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 13:32:23,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 13:32:23,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 13:32:23,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 13:32:23,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 13:32:23,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 13:32:23,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 13:32:23,092 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 13:32:23,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 13:32:23,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 13:32:23,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 13:32:23,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 13:32:23,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 13:32:23,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 13:32:23,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 13:32:23,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 13:32:23,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 13:32:23,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 13:32:23,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 13:32:23,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 13:32:23,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 13:32:23,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 13:32:23,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 13:32:23,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 13:32:23,097 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 13:32:23,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 13:32:23,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 13:32:23,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 13:32:23,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 13:32:23,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 13:32:23,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 13:32:23,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 13:32:23,330 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 13:32:23,331 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-18 13:32:23,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3878e2e5/4260f976b17b4d5b8ce086dd96f9d524/FLAG9e3a038b6 [2022-03-18 13:32:23,737 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 13:32:23,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-18 13:32:23,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3878e2e5/4260f976b17b4d5b8ce086dd96f9d524/FLAG9e3a038b6 [2022-03-18 13:32:23,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3878e2e5/4260f976b17b4d5b8ce086dd96f9d524 [2022-03-18 13:32:23,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 13:32:23,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 13:32:23,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 13:32:23,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 13:32:23,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 13:32:23,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1e0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23, skipping insertion in model container [2022-03-18 13:32:23,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 13:32:23,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 13:32:23,916 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-18 13:32:23,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 13:32:23,947 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 13:32:23,957 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-18 13:32:23,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 13:32:23,974 INFO L208 MainTranslator]: Completed translation [2022-03-18 13:32:23,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23 WrapperNode [2022-03-18 13:32:23,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 13:32:23,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 13:32:23,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 13:32:23,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 13:32:23,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:23,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:24,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:24,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:24,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 13:32:24,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 13:32:24,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 13:32:24,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 13:32:24,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (1/1) ... [2022-03-18 13:32:24,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 13:32:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:24,084 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-18 13:32:24,096 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-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 13:32:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 13:32:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 13:32:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 13:32:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 13:32:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 13:32:24,170 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 13:32:24,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 13:32:24,316 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 13:32:24,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 13:32:24,320 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 13:32:24,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 01:32:24 BoogieIcfgContainer [2022-03-18 13:32:24,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 13:32:24,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 13:32:24,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 13:32:24,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 13:32:24,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 01:32:23" (1/3) ... [2022-03-18 13:32:24,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565dd922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 01:32:24, skipping insertion in model container [2022-03-18 13:32:24,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 01:32:23" (2/3) ... [2022-03-18 13:32:24,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565dd922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 01:32:24, skipping insertion in model container [2022-03-18 13:32:24,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 01:32:24" (3/3) ... [2022-03-18 13:32:24,339 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-03-18 13:32:24,342 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 13:32:24,342 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 13:32:24,369 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 13:32:24,374 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 13:32:24,374 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 13:32:24,384 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-18 13:32:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 13:32:24,388 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:24,388 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 13:32:24,389 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-03-18 13:32:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:24,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875168205] [2022-03-18 13:32:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 13:32:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:24,549 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-18 13:32:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:24,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875168205] [2022-03-18 13:32:24,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875168205] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:24,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:24,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 13:32:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787713952] [2022-03-18 13:32:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:24,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 13:32:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 13:32:24,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 13:32:24,578 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-18 13:32:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:24,680 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-03-18 13:32:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 13:32:24,682 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-18 13:32:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:24,688 INFO L225 Difference]: With dead ends: 57 [2022-03-18 13:32:24,688 INFO L226 Difference]: Without dead ends: 27 [2022-03-18 13:32:24,695 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-18 13:32:24,701 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-18 13:32:24,702 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-18 13:32:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-18 13:32:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-03-18 13:32:24,737 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-18 13:32:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-03-18 13:32:24,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-03-18 13:32:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:24,743 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-03-18 13:32:24,743 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-18 13:32:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-03-18 13:32:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-18 13:32:24,744 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:24,744 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 13:32:24,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 13:32:24,745 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-03-18 13:32:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:24,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099837161] [2022-03-18 13:32:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 13:32:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:24,859 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-18 13:32:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:24,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099837161] [2022-03-18 13:32:24,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099837161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:24,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:24,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 13:32:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790304007] [2022-03-18 13:32:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:24,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 13:32:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 13:32:24,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 13:32:24,862 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-18 13:32:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:24,964 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-03-18 13:32:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 13:32:24,965 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-18 13:32:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:24,966 INFO L225 Difference]: With dead ends: 40 [2022-03-18 13:32:24,967 INFO L226 Difference]: Without dead ends: 28 [2022-03-18 13:32:24,970 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-18 13:32:24,972 INFO L912 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-18 13:32:24,972 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-18 13:32:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-18 13:32:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-18 13:32:24,981 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-18 13:32:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-03-18 13:32:24,984 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-03-18 13:32:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:24,986 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-03-18 13:32:24,986 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-18 13:32:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-03-18 13:32:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-18 13:32:24,986 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:24,986 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 13:32:24,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 13:32:24,987 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:24,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-03-18 13:32:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:24,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189916337] [2022-03-18 13:32:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 13:32:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:25,093 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-18 13:32:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189916337] [2022-03-18 13:32:25,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189916337] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:25,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 13:32:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778048890] [2022-03-18 13:32:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:25,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 13:32:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 13:32:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-18 13:32:25,096 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-18 13:32:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:25,211 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-03-18 13:32:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 13:32:25,211 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-18 13:32:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:25,213 INFO L225 Difference]: With dead ends: 34 [2022-03-18 13:32:25,213 INFO L226 Difference]: Without dead ends: 32 [2022-03-18 13:32:25,213 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-18 13:32:25,218 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-18 13:32:25,219 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-18 13:32:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-18 13:32:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-18 13:32:25,231 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-18 13:32:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-03-18 13:32:25,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-03-18 13:32:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:25,233 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-03-18 13:32:25,233 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-18 13:32:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-03-18 13:32:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 13:32:25,234 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:25,234 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 13:32:25,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 13:32:25,234 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-03-18 13:32:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:25,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158649868] [2022-03-18 13:32:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:25,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:25,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236276286] [2022-03-18 13:32:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:25,246 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-18 13:32:25,247 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-18 13:32:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:25,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 13:32:25,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:25,348 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-18 13:32:25,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 13:32:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:25,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158649868] [2022-03-18 13:32:25,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:25,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236276286] [2022-03-18 13:32:25,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236276286] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:25,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:25,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 13:32:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619674111] [2022-03-18 13:32:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:25,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 13:32:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:25,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 13:32:25,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 13:32:25,383 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-18 13:32:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:25,437 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-03-18 13:32:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 13:32:25,437 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-18 13:32:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:25,438 INFO L225 Difference]: With dead ends: 50 [2022-03-18 13:32:25,438 INFO L226 Difference]: Without dead ends: 48 [2022-03-18 13:32:25,438 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-18 13:32:25,439 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:25,439 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 13:32:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-18 13:32:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-03-18 13:32:25,445 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-18 13:32:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-03-18 13:32:25,445 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-03-18 13:32:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:25,446 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-03-18 13:32:25,446 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-18 13:32:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-03-18 13:32:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 13:32:25,446 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:25,446 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-18 13:32:25,463 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-18 13:32:25,664 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-18 13:32:25,664 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-03-18 13:32:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:25,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214575622] [2022-03-18 13:32:25,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:25,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:25,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326647206] [2022-03-18 13:32:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:25,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:25,673 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-18 13:32:25,674 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-18 13:32:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:25,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 13:32:25,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:25,764 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-18 13:32:25,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 13:32:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:25,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214575622] [2022-03-18 13:32:25,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:25,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326647206] [2022-03-18 13:32:25,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326647206] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:25,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:25,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 13:32:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025881423] [2022-03-18 13:32:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:25,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 13:32:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 13:32:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 13:32:25,766 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-18 13:32:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:25,800 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-03-18 13:32:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 13:32:25,801 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-18 13:32:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:25,802 INFO L225 Difference]: With dead ends: 54 [2022-03-18 13:32:25,802 INFO L226 Difference]: Without dead ends: 52 [2022-03-18 13:32:25,802 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-18 13:32:25,802 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:25,803 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 159 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 13:32:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-18 13:32:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-03-18 13:32:25,808 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-18 13:32:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-03-18 13:32:25,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-03-18 13:32:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:25,809 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-03-18 13:32:25,810 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-18 13:32:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-03-18 13:32:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-18 13:32:25,810 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:25,810 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-18 13:32:25,827 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-18 13:32:26,035 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-18 13:32:26,035 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-03-18 13:32:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126106905] [2022-03-18 13:32:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:26,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:26,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382834820] [2022-03-18 13:32:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:26,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:26,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:26,044 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-18 13:32:26,046 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-18 13:32:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:26,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 13:32:26,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:26,151 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-18 13:32:26,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 13:32:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126106905] [2022-03-18 13:32:26,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382834820] [2022-03-18 13:32:26,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382834820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 13:32:26,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 13:32:26,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 13:32:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985993749] [2022-03-18 13:32:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 13:32:26,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 13:32:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:26,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 13:32:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 13:32:26,153 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-18 13:32:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:26,196 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-03-18 13:32:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 13:32:26,196 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-18 13:32:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:26,197 INFO L225 Difference]: With dead ends: 62 [2022-03-18 13:32:26,197 INFO L226 Difference]: Without dead ends: 50 [2022-03-18 13:32:26,197 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-18 13:32:26,198 INFO L912 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 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-18 13:32:26,198 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 13:32:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-18 13:32:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-18 13:32:26,203 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-18 13:32:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-03-18 13:32:26,203 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-03-18 13:32:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:26,203 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-03-18 13:32:26,204 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-18 13:32:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-03-18 13:32:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-18 13:32:26,205 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:26,205 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-18 13:32:26,236 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-18 13:32:26,436 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-18 13:32:26,437 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-03-18 13:32:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:26,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875594714] [2022-03-18 13:32:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:26,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:26,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282883286] [2022-03-18 13:32:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:26,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:26,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:26,445 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-18 13:32:26,446 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-18 13:32:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:26,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 13:32:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:26,589 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-18 13:32:26,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:26,682 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-18 13:32:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875594714] [2022-03-18 13:32:26,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282883286] [2022-03-18 13:32:26,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282883286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:26,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:26,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-18 13:32:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552428500] [2022-03-18 13:32:26,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:26,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 13:32:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 13:32:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-18 13:32:26,684 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-18 13:32:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:26,781 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-03-18 13:32:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 13:32:26,781 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-18 13:32:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:26,782 INFO L225 Difference]: With dead ends: 120 [2022-03-18 13:32:26,782 INFO L226 Difference]: Without dead ends: 104 [2022-03-18 13:32:26,783 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-18 13:32:26,783 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:26,783 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 13:32:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-18 13:32:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-03-18 13:32:26,793 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-18 13:32:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-03-18 13:32:26,794 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-03-18 13:32:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:26,795 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-03-18 13:32:26,795 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-18 13:32:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-03-18 13:32:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-18 13:32:26,795 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:26,796 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-18 13:32:26,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 13:32:27,012 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-18 13:32:27,012 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-03-18 13:32:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:27,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254987328] [2022-03-18 13:32:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:27,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:27,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577590213] [2022-03-18 13:32:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:27,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:27,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:27,021 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-18 13:32:27,036 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-18 13:32:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:27,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 13:32:27,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:27,228 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-18 13:32:27,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:27,322 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-18 13:32:27,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254987328] [2022-03-18 13:32:27,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577590213] [2022-03-18 13:32:27,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577590213] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:27,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:27,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-18 13:32:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823472608] [2022-03-18 13:32:27,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:27,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 13:32:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 13:32:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-18 13:32:27,325 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-18 13:32:30,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:32:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:31,067 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-03-18 13:32:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 13:32:31,068 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-18 13:32:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:31,069 INFO L225 Difference]: With dead ends: 118 [2022-03-18 13:32:31,069 INFO L226 Difference]: Without dead ends: 116 [2022-03-18 13:32:31,069 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-18 13:32:31,069 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:31,070 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-03-18 13:32:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-18 13:32:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-03-18 13:32:31,084 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-18 13:32:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-03-18 13:32:31,085 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-03-18 13:32:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:31,085 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-03-18 13:32:31,085 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-18 13:32:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-03-18 13:32:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-18 13:32:31,086 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:31,086 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-18 13:32:31,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-18 13:32:31,302 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-18 13:32:31,302 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-03-18 13:32:31,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:31,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453259474] [2022-03-18 13:32:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:31,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:31,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936329911] [2022-03-18 13:32:31,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 13:32:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:31,326 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-18 13:32:31,327 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-18 13:32:31,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 13:32:31,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:31,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 13:32:31,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:31,499 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-18 13:32:31,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:31,580 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-18 13:32:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453259474] [2022-03-18 13:32:31,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936329911] [2022-03-18 13:32:31,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936329911] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:31,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:31,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-18 13:32:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009601151] [2022-03-18 13:32:31,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:31,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 13:32:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 13:32:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-18 13:32:31,582 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-18 13:32:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:31,645 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-03-18 13:32:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 13:32:31,646 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-18 13:32:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:31,646 INFO L225 Difference]: With dead ends: 122 [2022-03-18 13:32:31,646 INFO L226 Difference]: Without dead ends: 120 [2022-03-18 13:32:31,647 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-18 13:32:31,647 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.0s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:31,647 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.0s Time] [2022-03-18 13:32:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-03-18 13:32:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-03-18 13:32:31,660 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-18 13:32:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-03-18 13:32:31,661 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-03-18 13:32:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:31,661 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-03-18 13:32:31,662 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-18 13:32:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-03-18 13:32:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-18 13:32:31,662 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:31,662 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-18 13:32:31,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-18 13:32:31,878 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-18 13:32:31,878 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-03-18 13:32:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:31,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416369137] [2022-03-18 13:32:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:31,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:31,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493406000] [2022-03-18 13:32:31,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 13:32:31,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:31,885 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-18 13:32:31,886 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-18 13:32:31,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-18 13:32:31,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:31,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-18 13:32:31,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:32,082 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-18 13:32:32,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:32,251 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-18 13:32:32,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416369137] [2022-03-18 13:32:32,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493406000] [2022-03-18 13:32:32,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493406000] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:32,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:32,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-18 13:32:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129678089] [2022-03-18 13:32:32,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:32,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 13:32:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 13:32:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-18 13:32:32,252 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-18 13:32:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:32,433 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-03-18 13:32:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 13:32:32,433 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-18 13:32:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:32,434 INFO L225 Difference]: With dead ends: 146 [2022-03-18 13:32:32,434 INFO L226 Difference]: Without dead ends: 127 [2022-03-18 13:32:32,434 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-18 13:32:32,435 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:32,435 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 168 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 13:32:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-03-18 13:32:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-03-18 13:32:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 78 states have internal predecessors, (82), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-18 13:32:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2022-03-18 13:32:32,450 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 55 [2022-03-18 13:32:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:32,450 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2022-03-18 13:32:32,450 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-18 13:32:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2022-03-18 13:32:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-18 13:32:32,452 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:32,453 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-18 13:32:32,471 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-18 13:32:32,667 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-18 13:32:32,667 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-03-18 13:32:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:32,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638977944] [2022-03-18 13:32:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:32,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:32,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43923436] [2022-03-18 13:32:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:32,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:32,675 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-18 13:32:32,676 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-18 13:32:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:32,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-18 13:32:32,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:33,207 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-18 13:32:33,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:33,453 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-18 13:32:33,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:33,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638977944] [2022-03-18 13:32:33,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:33,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43923436] [2022-03-18 13:32:33,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43923436] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:33,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:33,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-18 13:32:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296536194] [2022-03-18 13:32:33,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:33,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 13:32:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 13:32:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-18 13:32:33,454 INFO L87 Difference]: Start difference. First operand 127 states and 140 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-18 13:32:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:33,680 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-03-18 13:32:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 13:32:33,681 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-18 13:32:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:33,681 INFO L225 Difference]: With dead ends: 140 [2022-03-18 13:32:33,681 INFO L226 Difference]: Without dead ends: 136 [2022-03-18 13:32:33,682 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-18 13:32:33,682 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:33,682 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 316 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 13:32:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-03-18 13:32:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-03-18 13:32:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.075) internal successors, (86), 82 states have internal predecessors, (86), 31 states have call successors, (31), 23 states have call predecessors, (31), 21 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-18 13:32:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-03-18 13:32:33,695 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 71 [2022-03-18 13:32:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:33,695 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-03-18 13:32:33,695 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-18 13:32:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-03-18 13:32:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-18 13:32:33,696 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:33,696 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-18 13:32:33,712 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-18 13:32:33,911 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-18 13:32:33,912 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-03-18 13:32:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326690670] [2022-03-18 13:32:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:33,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229698209] [2022-03-18 13:32:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:33,940 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-18 13:32:33,941 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-18 13:32:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 13:32:33,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-18 13:32:33,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:34,238 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-18 13:32:34,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:34,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326690670] [2022-03-18 13:32:34,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:34,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229698209] [2022-03-18 13:32:34,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229698209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 13:32:34,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-18 13:32:34,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-03-18 13:32:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357667515] [2022-03-18 13:32:34,389 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:34,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-18 13:32:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-18 13:32:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-18 13:32:34,390 INFO L87 Difference]: Start difference. First operand 133 states and 144 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-18 13:32:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:34,460 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-03-18 13:32:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 13:32:34,460 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-18 13:32:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:34,461 INFO L225 Difference]: With dead ends: 135 [2022-03-18 13:32:34,461 INFO L226 Difference]: Without dead ends: 124 [2022-03-18 13:32:34,461 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-18 13:32:34,462 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.0s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:34,462 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.0s Time] [2022-03-18 13:32:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-18 13:32:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-03-18 13:32:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 77 states have internal predecessors, (80), 28 states have call successors, (28), 21 states have call predecessors, (28), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-18 13:32:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2022-03-18 13:32:34,472 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 76 [2022-03-18 13:32:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:34,472 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2022-03-18 13:32:34,473 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-18 13:32:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2022-03-18 13:32:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-18 13:32:34,473 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:34,473 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-18 13:32:34,507 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-18 13:32:34,688 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-18 13:32:34,688 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-03-18 13:32:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:34,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434664045] [2022-03-18 13:32:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:34,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:34,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533120943] [2022-03-18 13:32:34,694 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 13:32:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:34,695 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-18 13:32:34,734 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-18 13:32:36,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 13:32:36,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:36,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-18 13:32:36,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:37,224 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-18 13:32:37,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:37,642 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-18 13:32:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434664045] [2022-03-18 13:32:37,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533120943] [2022-03-18 13:32:37,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533120943] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:37,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:37,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-03-18 13:32:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266823426] [2022-03-18 13:32:37,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:37,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 13:32:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 13:32:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-18 13:32:37,644 INFO L87 Difference]: Start difference. First operand 124 states and 133 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-18 13:32:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:37,748 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-03-18 13:32:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 13:32:37,749 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-18 13:32:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:37,749 INFO L225 Difference]: With dead ends: 134 [2022-03-18 13:32:37,749 INFO L226 Difference]: Without dead ends: 130 [2022-03-18 13:32:37,750 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-18 13:32:37,750 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:37,750 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 157 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 13:32:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-18 13:32:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-03-18 13:32:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.05) internal successors, (84), 81 states have internal predecessors, (84), 28 states have call successors, (28), 23 states have call predecessors, (28), 21 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-18 13:32:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-03-18 13:32:37,763 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 78 [2022-03-18 13:32:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:37,763 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-03-18 13:32:37,763 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-18 13:32:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-03-18 13:32:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-18 13:32:37,764 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:37,764 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-18 13:32:37,770 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-18 13:32:37,970 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-18 13:32:37,971 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-03-18 13:32:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:37,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706283641] [2022-03-18 13:32:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:37,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:37,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132948735] [2022-03-18 13:32:37,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 13:32:37,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:37,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:37,990 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-18 13:32:37,991 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-18 13:32:38,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 13:32:38,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:38,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-18 13:32:38,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:38,356 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-18 13:32:38,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:38,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706283641] [2022-03-18 13:32:38,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:38,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132948735] [2022-03-18 13:32:38,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132948735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 13:32:38,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-18 13:32:38,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-18 13:32:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924878763] [2022-03-18 13:32:38,510 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:38,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 13:32:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 13:32:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-18 13:32:38,511 INFO L87 Difference]: Start difference. First operand 130 states and 137 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-18 13:32:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:38,668 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-03-18 13:32:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 13:32:38,669 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-18 13:32:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:38,669 INFO L225 Difference]: With dead ends: 136 [2022-03-18 13:32:38,669 INFO L226 Difference]: Without dead ends: 125 [2022-03-18 13:32:38,670 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-18 13:32:38,670 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-18 13:32:38,670 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-18 13:32:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-18 13:32:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-03-18 13:32:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 25 states have call successors, (25), 22 states have call predecessors, (25), 21 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-18 13:32:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-03-18 13:32:38,682 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 104 [2022-03-18 13:32:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:38,682 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-03-18 13:32:38,682 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-18 13:32:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-03-18 13:32:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-03-18 13:32:38,683 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:38,683 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-18 13:32:38,725 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-18 13:32:38,908 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-18 13:32:38,908 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-03-18 13:32:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:38,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640892316] [2022-03-18 13:32:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:38,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:38,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9179226] [2022-03-18 13:32:38,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 13:32:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:38,926 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-18 13:32:38,926 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-18 13:32:39,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 13:32:39,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-18 13:32:39,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:39,435 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-18 13:32:39,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:39,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640892316] [2022-03-18 13:32:39,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:39,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9179226] [2022-03-18 13:32:39,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9179226] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 13:32:39,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-18 13:32:39,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-18 13:32:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358955997] [2022-03-18 13:32:39,596 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:39,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 13:32:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 13:32:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-18 13:32:39,597 INFO L87 Difference]: Start difference. First operand 125 states and 129 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-18 13:32:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:39,774 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-03-18 13:32:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 13:32:39,775 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-18 13:32:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:39,776 INFO L225 Difference]: With dead ends: 148 [2022-03-18 13:32:39,776 INFO L226 Difference]: Without dead ends: 146 [2022-03-18 13:32:39,776 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 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-18 13:32:39,776 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-18 13:32:39,777 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-18 13:32:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-03-18 13:32:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-03-18 13:32:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 90 states have internal predecessors, (92), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-03-18 13:32:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2022-03-18 13:32:39,791 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 127 [2022-03-18 13:32:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:39,791 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2022-03-18 13:32:39,791 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-18 13:32:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2022-03-18 13:32:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-03-18 13:32:39,792 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:39,810 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-18 13:32:39,835 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-18 13:32:40,026 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-18 13:32:40,027 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-03-18 13:32:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:40,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503696175] [2022-03-18 13:32:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:40,040 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:40,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954027355] [2022-03-18 13:32:40,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 13:32:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:40,042 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-18 13:32:40,043 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-18 13:32:40,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 13:32:40,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:40,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 13:32:40,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:40,364 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-18 13:32:40,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:40,613 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-18 13:32:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:40,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503696175] [2022-03-18 13:32:40,613 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:40,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954027355] [2022-03-18 13:32:40,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954027355] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:40,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:40,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-18 13:32:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223861946] [2022-03-18 13:32:40,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:40,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 13:32:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 13:32:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-18 13:32:40,614 INFO L87 Difference]: Start difference. First operand 145 states and 154 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-18 13:32:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:40,910 INFO L93 Difference]: Finished difference Result 340 states and 367 transitions. [2022-03-18 13:32:40,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-18 13:32:40,910 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-18 13:32:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:40,912 INFO L225 Difference]: With dead ends: 340 [2022-03-18 13:32:40,912 INFO L226 Difference]: Without dead ends: 325 [2022-03-18 13:32:40,912 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-18 13:32:40,912 INFO L912 BasicCegarLoop]: 86 mSDtfsCounter, 125 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:40,913 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 370 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 13:32:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-03-18 13:32:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 283. [2022-03-18 13:32:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 179 states have internal predecessors, (182), 63 states have call successors, (63), 48 states have call predecessors, (63), 46 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-18 13:32:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 305 transitions. [2022-03-18 13:32:40,941 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 305 transitions. Word has length 129 [2022-03-18 13:32:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:40,941 INFO L478 AbstractCegarLoop]: Abstraction has 283 states and 305 transitions. [2022-03-18 13:32:40,941 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-18 13:32:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 305 transitions. [2022-03-18 13:32:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-18 13:32:40,942 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:40,942 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-18 13:32:40,958 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-18 13:32:41,158 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-18 13:32:41,159 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-03-18 13:32:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:41,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420364112] [2022-03-18 13:32:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:41,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:41,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322848831] [2022-03-18 13:32:41,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 13:32:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:41,183 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-18 13:32:41,184 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-18 13:32:41,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 13:32:41,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:41,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-18 13:32:41,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:41,952 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-18 13:32:41,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420364112] [2022-03-18 13:32:42,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322848831] [2022-03-18 13:32:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322848831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 13:32:42,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-18 13:32:42,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-18 13:32:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658192417] [2022-03-18 13:32:42,144 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:42,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 13:32:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 13:32:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-18 13:32:42,145 INFO L87 Difference]: Start difference. First operand 283 states and 305 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-18 13:32:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:42,318 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2022-03-18 13:32:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 13:32:42,325 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-18 13:32:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:42,330 INFO L225 Difference]: With dead ends: 289 [2022-03-18 13:32:42,331 INFO L226 Difference]: Without dead ends: 278 [2022-03-18 13:32:42,331 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-18 13:32:42,331 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-18 13:32:42,332 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-18 13:32:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-18 13:32:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-03-18 13:32:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 171 states have (on average 1.0467836257309941) internal successors, (179), 177 states have internal predecessors, (179), 60 states have call successors, (60), 47 states have call predecessors, (60), 46 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-03-18 13:32:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 297 transitions. [2022-03-18 13:32:42,380 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 297 transitions. Word has length 132 [2022-03-18 13:32:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:42,382 INFO L478 AbstractCegarLoop]: Abstraction has 278 states and 297 transitions. [2022-03-18 13:32:42,382 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-18 13:32:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 297 transitions. [2022-03-18 13:32:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-18 13:32:42,384 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:42,384 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-18 13:32:42,391 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-18 13:32:42,588 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-18 13:32:42,589 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-03-18 13:32:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101592455] [2022-03-18 13:32:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:42,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:42,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944364954] [2022-03-18 13:32:42,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 13:32:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:42,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:42,603 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-18 13:32:42,604 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-18 13:32:43,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-18 13:32:43,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:43,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 13:32:43,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:32:43,347 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-18 13:32:43,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:32:43,951 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-18 13:32:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:32:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101592455] [2022-03-18 13:32:43,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:32:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944364954] [2022-03-18 13:32:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944364954] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:32:43,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:32:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-03-18 13:32:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323679794] [2022-03-18 13:32:43,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:32:43,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 13:32:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:32:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 13:32:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-18 13:32:43,953 INFO L87 Difference]: Start difference. First operand 278 states and 297 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-18 13:32:46,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-18 13:32:47,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:32:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:32:48,228 INFO L93 Difference]: Finished difference Result 287 states and 307 transitions. [2022-03-18 13:32:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 13:32:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-03-18 13:32:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:32:48,230 INFO L225 Difference]: With dead ends: 287 [2022-03-18 13:32:48,230 INFO L226 Difference]: Without dead ends: 285 [2022-03-18 13:32:48,231 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-03-18 13:32:48,231 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-18 13:32:48,232 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-03-18 13:32:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-18 13:32:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2022-03-18 13:32:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 174 states have (on average 1.0459770114942528) internal successors, (182), 181 states have internal predecessors, (182), 62 states have call successors, (62), 48 states have call predecessors, (62), 47 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-18 13:32:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2022-03-18 13:32:48,272 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 155 [2022-03-18 13:32:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:32:48,273 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2022-03-18 13:32:48,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-18 13:32:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2022-03-18 13:32:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-18 13:32:48,274 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:32:48,274 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-18 13:32:48,279 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-18 13:32:48,479 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-18 13:32:48,479 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:32:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:32:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-03-18 13:32:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:32:48,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012866630] [2022-03-18 13:32:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:32:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:32:48,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:32:48,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994311486] [2022-03-18 13:32:48,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 13:32:48,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:32:48,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:32:48,496 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-18 13:32:48,497 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-18 13:32:50,452 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 13:32:50,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:32:50,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-18 13:32:50,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:33:02,994 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-18 13:33:02,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:33:06,188 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-18 13:33:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:33:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012866630] [2022-03-18 13:33:06,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:33:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994311486] [2022-03-18 13:33:06,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994311486] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:33:06,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:33:06,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-03-18 13:33:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943424892] [2022-03-18 13:33:06,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:33:06,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-18 13:33:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:33:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-18 13:33:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=268, Unknown=3, NotChecked=0, Total=342 [2022-03-18 13:33:06,199 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand has 19 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) [2022-03-18 13:33:10,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:33:12,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:33:16,738 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-18 13:33:19,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:33:21,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:33:23,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 13:33:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:33:25,620 INFO L93 Difference]: Finished difference Result 291 states and 310 transitions. [2022-03-18 13:33:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 13:33:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) Word has length 160 [2022-03-18 13:33:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:33:25,621 INFO L225 Difference]: With dead ends: 291 [2022-03-18 13:33:25,621 INFO L226 Difference]: Without dead ends: 270 [2022-03-18 13:33:25,622 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 300 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=136, Invalid=460, Unknown=4, NotChecked=0, Total=600 [2022-03-18 13:33:25,622 INFO L912 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 89 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-03-18 13:33:25,622 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 13.6s Time] [2022-03-18 13:33:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-03-18 13:33:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-03-18 13:33:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 170 states have (on average 1.0058823529411764) internal successors, (171), 170 states have internal predecessors, (171), 54 states have call successors, (54), 47 states have call predecessors, (54), 45 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-03-18 13:33:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 277 transitions. [2022-03-18 13:33:25,655 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 277 transitions. Word has length 160 [2022-03-18 13:33:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:33:25,655 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 277 transitions. [2022-03-18 13:33:25,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 13 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) [2022-03-18 13:33:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 277 transitions. [2022-03-18 13:33:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-03-18 13:33:25,657 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:33:25,657 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-18 13:33:25,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-18 13:33:25,864 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-18 13:33:25,864 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:33:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:33:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-03-18 13:33:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:33:25,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522325802] [2022-03-18 13:33:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:33:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:33:25,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:33:25,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515088246] [2022-03-18 13:33:25,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 13:33:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:33:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:33:25,887 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-18 13:33:25,887 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-18 13:33:26,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-03-18 13:33:26,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 13:33:26,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-18 13:33:26,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 13:33:26,673 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-18 13:33:26,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 13:33:27,190 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-18 13:33:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 13:33:27,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522325802] [2022-03-18 13:33:27,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 13:33:27,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515088246] [2022-03-18 13:33:27,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515088246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 13:33:27,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 13:33:27,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-18 13:33:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922683710] [2022-03-18 13:33:27,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 13:33:27,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-18 13:33:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 13:33:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-18 13:33:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-18 13:33:27,192 INFO L87 Difference]: Start difference. First operand 270 states and 277 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-18 13:33:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 13:33:27,800 INFO L93 Difference]: Finished difference Result 520 states and 546 transitions. [2022-03-18 13:33:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-18 13:33:27,801 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-18 13:33:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 13:33:27,803 INFO L225 Difference]: With dead ends: 520 [2022-03-18 13:33:27,803 INFO L226 Difference]: Without dead ends: 510 [2022-03-18 13:33:27,804 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-18 13:33:27,804 INFO L912 BasicCegarLoop]: 121 mSDtfsCounter, 241 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 13:33:27,805 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 470 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 13:33:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-03-18 13:33:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-03-18 13:33:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 320 states have (on average 1.003125) internal successors, (321), 320 states have internal predecessors, (321), 104 states have call successors, (104), 87 states have call predecessors, (104), 85 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-03-18 13:33:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 527 transitions. [2022-03-18 13:33:27,855 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 527 transitions. Word has length 297 [2022-03-18 13:33:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 13:33:27,855 INFO L478 AbstractCegarLoop]: Abstraction has 510 states and 527 transitions. [2022-03-18 13:33:27,856 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-18 13:33:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 527 transitions. [2022-03-18 13:33:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-03-18 13:33:27,858 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 13:33:27,858 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-18 13:33:27,872 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-18 13:33:28,059 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-18 13:33:28,059 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 13:33:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 13:33:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1184532997, now seen corresponding path program 4 times [2022-03-18 13:33:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 13:33:28,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623006991] [2022-03-18 13:33:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 13:33:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 13:33:28,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 13:33:28,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197038651] [2022-03-18 13:33:28,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 13:33:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 13:33:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 13:33:28,086 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-18 13:33:28,090 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-18 13:33:28,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 13:33:28,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-18 13:33:28,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-18 13:33:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-18 13:33:28,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-18 13:33:28,909 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-18 13:33:28,910 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 13:33:28,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-18 13:33:29,111 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-18 13:33:29,114 INFO L718 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-18 13:33:29,117 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 13:33:29,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 01:33:29 BoogieIcfgContainer [2022-03-18 13:33:29,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 13:33:29,257 INFO L158 Benchmark]: Toolchain (without parser) took 65499.74ms. Allocated memory was 175.1MB in the beginning and 306.2MB in the end (delta: 131.1MB). Free memory was 125.3MB in the beginning and 213.6MB in the end (delta: -88.3MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2022-03-18 13:33:29,257 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 13:33:29,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 175.1MB. Free memory was 125.1MB in the beginning and 150.1MB in the end (delta: -25.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-03-18 13:33:29,261 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 175.1MB. Free memory was 150.1MB in the beginning and 148.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-18 13:33:29,261 INFO L158 Benchmark]: RCFGBuilder took 305.81ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-18 13:33:29,261 INFO L158 Benchmark]: TraceAbstraction took 64934.64ms. Allocated memory was 175.1MB in the beginning and 306.2MB in the end (delta: 131.1MB). Free memory was 136.6MB in the beginning and 213.6MB in the end (delta: -77.0MB). Peak memory consumption was 54.9MB. Max. memory is 8.0GB. [2022-03-18 13:33:29,263 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.09ms. Allocated memory is still 175.1MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 175.1MB. Free memory was 125.1MB in the beginning and 150.1MB in the end (delta: -25.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 175.1MB. Free memory was 150.1MB in the beginning and 148.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 305.81ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 64934.64ms. Allocated memory was 175.1MB in the beginning and 306.2MB in the end (delta: 131.1MB). Free memory was 136.6MB in the beginning and 213.6MB in the end (delta: -77.0MB). Peak memory consumption was 54.9MB. 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 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.7s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 4395 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3413 mSDsCounter, 736 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2386 IncrementalHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 736 mSolverCounterUnsat, 982 mSDtfsCounter, 2386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2918 GetRequests, 2669 SyntacticMatches, 22 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=20, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 11535 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 17136/23738 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-18 13:33:29,293 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...