/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 11:51:42,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 11:51:42,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 11:51:42,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 11:51:42,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 11:51:42,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 11:51:42,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 11:51:42,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 11:51:42,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 11:51:42,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 11:51:42,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 11:51:42,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 11:51:42,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 11:51:42,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 11:51:42,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 11:51:42,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 11:51:42,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 11:51:42,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 11:51:42,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 11:51:42,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 11:51:42,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 11:51:42,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 11:51:42,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 11:51:42,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 11:51:42,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 11:51:42,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 11:51:42,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 11:51:42,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 11:51:42,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 11:51:42,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 11:51:42,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 11:51:42,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 11:51:42,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 11:51:42,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 11:51:42,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 11:51:42,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 11:51:42,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 11:51:42,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 11:51:42,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 11:51:42,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 11:51:42,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 11:51:42,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 11:51:42,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 11:51:42,058 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 11:51:42,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 11:51:42,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 11:51:42,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 11:51:42,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 11:51:42,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 11:51:42,059 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 11:51:42,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 11:51:42,060 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 11:51:42,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 11:51:42,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 11:51:42,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 11:51:42,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 11:51:42,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 11:51:42,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 11:51:42,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 11:51:42,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 11:51:42,062 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 11:51:42,063 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 11:51:42,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 11:51:42,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 11:51:42,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 11:51:42,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 11:51:42,211 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 11:51:42,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2022-04-06 11:51:42,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973febbed/4f0f941a28fa48f3ae0a3cd9e3da3a6b/FLAG3a3719cc9 [2022-04-06 11:51:42,604 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 11:51:42,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2022-04-06 11:51:42,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973febbed/4f0f941a28fa48f3ae0a3cd9e3da3a6b/FLAG3a3719cc9 [2022-04-06 11:51:43,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973febbed/4f0f941a28fa48f3ae0a3cd9e3da3a6b [2022-04-06 11:51:43,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 11:51:43,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 11:51:43,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 11:51:43,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 11:51:43,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 11:51:43,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb4ba10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43, skipping insertion in model container [2022-04-06 11:51:43,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 11:51:43,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 11:51:43,144 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/egcd3-ll_unwindbound50.c[490,503] [2022-04-06 11:51:43,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 11:51:43,164 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 11:51:43,171 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/egcd3-ll_unwindbound50.c[490,503] [2022-04-06 11:51:43,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 11:51:43,187 INFO L208 MainTranslator]: Completed translation [2022-04-06 11:51:43,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43 WrapperNode [2022-04-06 11:51:43,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 11:51:43,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 11:51:43,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 11:51:43,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 11:51:43,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 11:51:43,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 11:51:43,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 11:51:43,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 11:51:43,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 11:51:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:43,235 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-04-06 11:51:43,236 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-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 11:51:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 11:51:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 11:51:43,306 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 11:51:43,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 11:51:43,403 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 11:51:43,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 11:51:43,408 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-06 11:51:43,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:51:43 BoogieIcfgContainer [2022-04-06 11:51:43,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 11:51:43,409 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 11:51:43,409 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 11:51:43,410 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 11:51:43,412 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:51:43" (1/1) ... [2022-04-06 11:51:43,413 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 11:51:43,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:51:43 BasicIcfg [2022-04-06 11:51:43,424 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 11:51:43,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 11:51:43,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 11:51:43,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 11:51:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 11:51:43" (1/4) ... [2022-04-06 11:51:43,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee55c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:51:43, skipping insertion in model container [2022-04-06 11:51:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 11:51:43" (2/4) ... [2022-04-06 11:51:43,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee55c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:51:43, skipping insertion in model container [2022-04-06 11:51:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:51:43" (3/4) ... [2022-04-06 11:51:43,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee55c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:51:43, skipping insertion in model container [2022-04-06 11:51:43,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 11:51:43" (4/4) ... [2022-04-06 11:51:43,429 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound50.cqvasr [2022-04-06 11:51:43,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 11:51:43,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 11:51:43,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 11:51:43,463 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 11:51:43,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 11:51:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-06 11:51:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 11:51:43,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:43,477 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:43,477 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-04-06 11:51:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441893464] [2022-04-06 11:51:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 11:51:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 11:51:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 11:51:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:43,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441893464] [2022-04-06 11:51:43,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441893464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:43,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:43,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 11:51:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394235043] [2022-04-06 11:51:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:43,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 11:51:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 11:51:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 11:51:43,708 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:43,786 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-06 11:51:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 11:51:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-06 11:51:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:43,792 INFO L225 Difference]: With dead ends: 74 [2022-04-06 11:51:43,793 INFO L226 Difference]: Without dead ends: 36 [2022-04-06 11:51:43,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-04-06 11:51:43,797 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:43,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-06 11:51:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-06 11:51:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 11:51:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-06 11:51:43,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-06 11:51:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:43,823 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-06 11:51:43,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-06 11:51:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 11:51:43,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:43,824 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:43,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 11:51:43,825 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-04-06 11:51:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:43,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207647960] [2022-04-06 11:51:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:43,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537278355] [2022-04-06 11:51:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:43,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:43,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:43,843 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-04-06 11:51:43,844 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-04-06 11:51:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:43,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 11:51:43,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:43,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:43,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207647960] [2022-04-06 11:51:43,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:43,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537278355] [2022-04-06 11:51:43,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537278355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:43,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:43,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 11:51:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670079047] [2022-04-06 11:51:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:43,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 11:51:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 11:51:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 11:51:43,962 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:43,973 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-06 11:51:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 11:51:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-06 11:51:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:43,975 INFO L225 Difference]: With dead ends: 44 [2022-04-06 11:51:43,975 INFO L226 Difference]: Without dead ends: 37 [2022-04-06 11:51:43,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 11:51:43,976 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:43,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-06 11:51:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-06 11:51:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 11:51:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-06 11:51:43,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-06 11:51:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:43,983 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-06 11:51:43,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-06 11:51:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-06 11:51:43,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:43,984 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:44,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 11:51:44,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:44,194 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-04-06 11:51:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:44,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618492657] [2022-04-06 11:51:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:44,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:44,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470619368] [2022-04-06 11:51:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:44,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:44,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:44,223 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-04-06 11:51:44,273 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-04-06 11:51:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:44,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:51:44,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:44,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618492657] [2022-04-06 11:51:44,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470619368] [2022-04-06 11:51:44,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470619368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:44,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:44,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 11:51:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468614912] [2022-04-06 11:51:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:44,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 11:51:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 11:51:44,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:51:44,382 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:44,461 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-06 11:51:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:51:44,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-06 11:51:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:44,463 INFO L225 Difference]: With dead ends: 57 [2022-04-06 11:51:44,463 INFO L226 Difference]: Without dead ends: 50 [2022-04-06 11:51:44,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:51:44,464 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:44,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-06 11:51:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-06 11:51:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 11:51:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-06 11:51:44,470 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-06 11:51:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:44,470 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-06 11:51:44,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-06 11:51:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 11:51:44,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:44,471 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:44,496 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-04-06 11:51:44,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-06 11:51:44,672 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-04-06 11:51:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:44,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174170342] [2022-04-06 11:51:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:44,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094736607] [2022-04-06 11:51:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:44,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:44,702 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-04-06 11:51:44,766 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-04-06 11:51:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:44,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:51:44,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:44,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:44,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174170342] [2022-04-06 11:51:44,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:44,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094736607] [2022-04-06 11:51:44,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094736607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:44,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:44,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:51:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069226801] [2022-04-06 11:51:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:44,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:51:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:51:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:51:44,836 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:44,854 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-06 11:51:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:51:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-06 11:51:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:44,856 INFO L225 Difference]: With dead ends: 62 [2022-04-06 11:51:44,856 INFO L226 Difference]: Without dead ends: 40 [2022-04-06 11:51:44,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:51:44,857 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:44,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-06 11:51:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-06 11:51:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 11:51:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-06 11:51:44,862 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-06 11:51:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:44,862 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-06 11:51:44,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-06 11:51:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 11:51:44,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:44,863 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:44,881 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-04-06 11:51:45,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:45,077 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-04-06 11:51:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241925902] [2022-04-06 11:51:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:45,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:45,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37596427] [2022-04-06 11:51:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:45,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:45,103 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-04-06 11:51:45,104 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-04-06 11:51:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:45,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-06 11:51:45,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:45,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:45,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241925902] [2022-04-06 11:51:45,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37596427] [2022-04-06 11:51:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37596427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 11:51:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535137765] [2022-04-06 11:51:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:45,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 11:51:45,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 11:51:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:51:45,356 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:45,490 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-06 11:51:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 11:51:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-06 11:51:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:45,491 INFO L225 Difference]: With dead ends: 68 [2022-04-06 11:51:45,492 INFO L226 Difference]: Without dead ends: 66 [2022-04-06 11:51:45,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:51:45,492 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:45,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 218 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-06 11:51:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-06 11:51:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-06 11:51:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-06 11:51:45,499 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-06 11:51:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:45,500 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-06 11:51:45,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-06 11:51:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 11:51:45,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:45,500 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:45,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-06 11:51:45,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:45,717 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-04-06 11:51:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837225440] [2022-04-06 11:51:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:45,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:45,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248133360] [2022-04-06 11:51:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:45,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:45,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:45,727 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-04-06 11:51:45,751 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-04-06 11:51:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 11:51:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:45,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837225440] [2022-04-06 11:51:45,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248133360] [2022-04-06 11:51:45,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248133360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:45,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:45,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-06 11:51:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731538305] [2022-04-06 11:51:45,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:45,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 11:51:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:45,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 11:51:45,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:51:45,963 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:46,074 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-06 11:51:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-06 11:51:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-06 11:51:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:46,077 INFO L225 Difference]: With dead ends: 151 [2022-04-06 11:51:46,077 INFO L226 Difference]: Without dead ends: 144 [2022-04-06 11:51:46,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-06 11:51:46,079 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:46,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 272 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-06 11:51:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-04-06 11:51:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-06 11:51:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-04-06 11:51:46,121 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-04-06 11:51:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:46,122 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-04-06 11:51:46,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-04-06 11:51:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-06 11:51:46,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:46,125 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:46,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 11:51:46,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:46,329 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-04-06 11:51:46,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:46,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479522941] [2022-04-06 11:51:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:46,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078843451] [2022-04-06 11:51:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:46,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:46,360 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-04-06 11:51:46,389 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-04-06 11:51:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:46,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 11:51:46,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:46,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479522941] [2022-04-06 11:51:46,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078843451] [2022-04-06 11:51:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078843451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:46,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:46,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-06 11:51:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469674613] [2022-04-06 11:51:46,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:46,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 11:51:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 11:51:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 11:51:46,571 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:46,730 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-04-06 11:51:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 11:51:46,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-06 11:51:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:46,731 INFO L225 Difference]: With dead ends: 187 [2022-04-06 11:51:46,731 INFO L226 Difference]: Without dead ends: 175 [2022-04-06 11:51:46,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-06 11:51:46,732 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:46,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 306 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-06 11:51:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-04-06 11:51:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-06 11:51:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-04-06 11:51:46,767 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-04-06 11:51:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:46,767 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-04-06 11:51:46,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-04-06 11:51:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 11:51:46,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:46,769 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:46,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 11:51:46,969 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:46,970 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-04-06 11:51:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:46,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995368178] [2022-04-06 11:51:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:46,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:46,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270223720] [2022-04-06 11:51:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:46,984 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-04-06 11:51:46,987 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-04-06 11:51:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:47,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-06 11:51:47,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:47,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:47,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:47,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995368178] [2022-04-06 11:51:47,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:47,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270223720] [2022-04-06 11:51:47,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270223720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:47,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:47,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 11:51:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459120662] [2022-04-06 11:51:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:47,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 11:51:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 11:51:47,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:51:47,270 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 11:51:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:47,455 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-04-06 11:51:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 11:51:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-06 11:51:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:47,456 INFO L225 Difference]: With dead ends: 157 [2022-04-06 11:51:47,457 INFO L226 Difference]: Without dead ends: 155 [2022-04-06 11:51:47,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-06 11:51:47,457 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:47,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-06 11:51:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-04-06 11:51:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-06 11:51:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-04-06 11:51:47,481 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-04-06 11:51:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:47,481 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-04-06 11:51:47,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 11:51:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-04-06 11:51:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-06 11:51:47,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:47,485 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:47,501 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-04-06 11:51:47,701 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:47,701 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-04-06 11:51:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914269927] [2022-04-06 11:51:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:47,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:47,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046549183] [2022-04-06 11:51:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:47,727 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-04-06 11:51:47,728 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-04-06 11:51:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:47,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-06 11:51:47,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 11:51:47,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:48,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914269927] [2022-04-06 11:51:48,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046549183] [2022-04-06 11:51:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046549183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:48,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:48,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-06 11:51:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789447276] [2022-04-06 11:51:48,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:48,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 11:51:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 11:51:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-06 11:51:48,090 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 11:51:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:48,238 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-04-06 11:51:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 11:51:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-06 11:51:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:48,240 INFO L225 Difference]: With dead ends: 179 [2022-04-06 11:51:48,240 INFO L226 Difference]: Without dead ends: 177 [2022-04-06 11:51:48,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:51:48,240 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:48,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 344 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-06 11:51:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-06 11:51:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-06 11:51:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-04-06 11:51:48,252 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-04-06 11:51:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:48,252 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-04-06 11:51:48,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 11:51:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-04-06 11:51:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-06 11:51:48,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:48,252 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:48,270 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-04-06 11:51:48,468 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,SelfDestructingSolverStorable8 [2022-04-06 11:51:48,468 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-04-06 11:51:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576231361] [2022-04-06 11:51:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:48,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:48,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151544589] [2022-04-06 11:51:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:48,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:48,479 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-04-06 11:51:48,480 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-04-06 11:51:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:48,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 11:51:48,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:48,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576231361] [2022-04-06 11:51:48,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151544589] [2022-04-06 11:51:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151544589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:48,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:48,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 11:51:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602082206] [2022-04-06 11:51:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:48,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 11:51:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 11:51:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:51:48,570 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:48,594 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-04-06 11:51:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:51:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-06 11:51:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:48,596 INFO L225 Difference]: With dead ends: 241 [2022-04-06 11:51:48,596 INFO L226 Difference]: Without dead ends: 174 [2022-04-06 11:51:48,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:51:48,597 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:48,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-06 11:51:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-06 11:51:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-06 11:51:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-06 11:51:48,607 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-04-06 11:51:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:48,607 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-06 11:51:48,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 11:51:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-06 11:51:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-06 11:51:48,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:48,608 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:48,624 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-04-06 11:51:48,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-06 11:51:48,824 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-04-06 11:51:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275057949] [2022-04-06 11:51:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:48,846 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:48,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516547596] [2022-04-06 11:51:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:48,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:48,847 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-04-06 11:51:48,848 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-04-06 11:51:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:48,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:51:48,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 11:51:48,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275057949] [2022-04-06 11:51:48,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516547596] [2022-04-06 11:51:48,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516547596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:48,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:48,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:51:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320600405] [2022-04-06 11:51:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:48,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:51:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:51:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:51:48,940 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 11:51:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:48,975 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-04-06 11:51:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:51:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-06 11:51:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:48,976 INFO L225 Difference]: With dead ends: 239 [2022-04-06 11:51:48,976 INFO L226 Difference]: Without dead ends: 237 [2022-04-06 11:51:48,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:51:48,977 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:48,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-06 11:51:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-04-06 11:51:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-06 11:51:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-04-06 11:51:48,991 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-04-06 11:51:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:48,991 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-04-06 11:51:48,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 11:51:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-04-06 11:51:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-06 11:51:48,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:48,991 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:49,009 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-04-06 11:51:49,198 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,SelfDestructingSolverStorable10 [2022-04-06 11:51:49,199 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-04-06 11:51:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:49,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574252346] [2022-04-06 11:51:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:49,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135442107] [2022-04-06 11:51:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:49,216 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-04-06 11:51:49,254 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-04-06 11:51:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:49,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-06 11:51:49,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:49,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574252346] [2022-04-06 11:51:49,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135442107] [2022-04-06 11:51:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135442107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:49,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-06 11:51:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366965692] [2022-04-06 11:51:49,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:49,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 11:51:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 11:51:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-06 11:51:49,515 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 11:51:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:50,025 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-04-06 11:51:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 11:51:50,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-06 11:51:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:50,027 INFO L225 Difference]: With dead ends: 392 [2022-04-06 11:51:50,027 INFO L226 Difference]: Without dead ends: 390 [2022-04-06 11:51:50,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-06 11:51:50,027 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 170 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:50,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 318 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 11:51:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-06 11:51:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-04-06 11:51:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-06 11:51:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-04-06 11:51:50,055 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-04-06 11:51:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:50,056 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-04-06 11:51:50,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 11:51:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-04-06 11:51:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 11:51:50,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:50,056 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:50,074 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-04-06 11:51:50,271 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,SelfDestructingSolverStorable11 [2022-04-06 11:51:50,271 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-04-06 11:51:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448922287] [2022-04-06 11:51:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:50,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434625282] [2022-04-06 11:51:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:50,288 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-04-06 11:51:50,289 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-04-06 11:51:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:50,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 11:51:50,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 11:51:50,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448922287] [2022-04-06 11:51:50,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434625282] [2022-04-06 11:51:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434625282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:50,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:51:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000843779] [2022-04-06 11:51:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:50,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:51:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:51:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:51:50,386 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-06 11:51:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:50,446 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-04-06 11:51:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:51:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-06 11:51:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:50,449 INFO L225 Difference]: With dead ends: 566 [2022-04-06 11:51:50,449 INFO L226 Difference]: Without dead ends: 564 [2022-04-06 11:51:50,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-04-06 11:51:50,451 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:50,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:51:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-06 11:51:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-04-06 11:51:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-06 11:51:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-04-06 11:51:50,500 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-04-06 11:51:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:50,500 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-04-06 11:51:50,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-06 11:51:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-04-06 11:51:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-06 11:51:50,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:50,501 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:50,542 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-04-06 11:51:50,717 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,SelfDestructingSolverStorable12 [2022-04-06 11:51:50,717 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-04-06 11:51:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:50,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214752915] [2022-04-06 11:51:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:50,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551067330] [2022-04-06 11:51:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:50,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:50,726 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-04-06 11:51:50,727 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-04-06 11:51:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:50,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-06 11:51:50,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-06 11:51:50,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-06 11:51:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214752915] [2022-04-06 11:51:50,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551067330] [2022-04-06 11:51:50,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551067330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:50,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:50,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-06 11:51:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905386362] [2022-04-06 11:51:50,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:50,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 11:51:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:50,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 11:51:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:51:50,949 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:51,148 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-04-06 11:51:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-06 11:51:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-06 11:51:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:51,152 INFO L225 Difference]: With dead ends: 1127 [2022-04-06 11:51:51,153 INFO L226 Difference]: Without dead ends: 770 [2022-04-06 11:51:51,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-04-06 11:51:51,154 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 169 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:51,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 342 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-06 11:51:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-04-06 11:51:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-06 11:51:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-04-06 11:51:51,210 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-04-06 11:51:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:51,210 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-04-06 11:51:51,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-04-06 11:51:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-06 11:51:51,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:51,211 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:51,229 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-04-06 11:51:51,423 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,SelfDestructingSolverStorable13 [2022-04-06 11:51:51,423 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-04-06 11:51:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:51,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317749478] [2022-04-06 11:51:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:51,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:51,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943202206] [2022-04-06 11:51:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:51,444 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-04-06 11:51:51,463 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-04-06 11:51:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 11:51:51,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:51,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 11:51:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317749478] [2022-04-06 11:51:51,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943202206] [2022-04-06 11:51:51,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943202206] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:51,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:51,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-06 11:51:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504898485] [2022-04-06 11:51:51,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:51,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 11:51:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 11:51:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-06 11:51:51,653 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:51,933 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-04-06 11:51:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-06 11:51:51,933 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), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-06 11:51:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:51,938 INFO L225 Difference]: With dead ends: 1597 [2022-04-06 11:51:51,938 INFO L226 Difference]: Without dead ends: 1119 [2022-04-06 11:51:51,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-04-06 11:51:51,941 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 255 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:51,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 319 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-04-06 11:51:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-04-06 11:51:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-06 11:51:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-04-06 11:51:52,030 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-04-06 11:51:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:52,030 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-04-06 11:51:52,030 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), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-06 11:51:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-04-06 11:51:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 11:51:52,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:52,031 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:52,049 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-04-06 11:51:52,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:52,244 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-04-06 11:51:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455662904] [2022-04-06 11:51:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:52,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:52,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462945604] [2022-04-06 11:51:52,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:51:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:52,272 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-04-06 11:51:52,281 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-04-06 11:51:52,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:51:52,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:51:52,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 11:51:52,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-06 11:51:52,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:51:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455662904] [2022-04-06 11:51:52,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462945604] [2022-04-06 11:51:52,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462945604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:51:52,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:51:52,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:51:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118677185] [2022-04-06 11:51:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:51:52,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:51:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:51:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:51:52,376 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:51:52,530 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-04-06 11:51:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:51:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-06 11:51:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:51:52,535 INFO L225 Difference]: With dead ends: 1700 [2022-04-06 11:51:52,535 INFO L226 Difference]: Without dead ends: 1234 [2022-04-06 11:51:52,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-06 11:51:52,536 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 11:51:52,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 170 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 11:51:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-04-06 11:51:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-04-06 11:51:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-06 11:51:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-04-06 11:51:52,615 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-04-06 11:51:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:51:52,615 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-04-06 11:51:52,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 11:51:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-04-06 11:51:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-06 11:51:52,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:51:52,615 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:51:52,635 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-04-06 11:51:52,835 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,SelfDestructingSolverStorable15 [2022-04-06 11:51:52,836 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:51:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:51:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-04-06 11:51:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:51:52,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549364706] [2022-04-06 11:51:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:51:52,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:51:52,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742863722] [2022-04-06 11:51:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:51:52,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:51:52,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:51:52,867 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-04-06 11:51:52,923 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-04-06 11:51:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:51:52,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-06 11:51:52,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:51:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 11:51:53,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:51:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 11:51:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:51:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549364706] [2022-04-06 11:51:54,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:51:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742863722] [2022-04-06 11:51:54,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742863722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:51:54,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:51:54,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-06 11:51:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909103148] [2022-04-06 11:51:54,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:51:54,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-06 11:51:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:51:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-06 11:51:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-06 11:51:54,019 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-06 11:51:58,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:52:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:52:00,884 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-04-06 11:52:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 11:52:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-06 11:52:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:52:00,889 INFO L225 Difference]: With dead ends: 1412 [2022-04-06 11:52:00,889 INFO L226 Difference]: Without dead ends: 1404 [2022-04-06 11:52:00,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-06 11:52:00,890 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-06 11:52:00,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 528 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-06 11:52:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-04-06 11:52:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-04-06 11:52:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-06 11:52:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-04-06 11:52:01,058 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-04-06 11:52:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:52:01,058 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-04-06 11:52:01,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-06 11:52:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-04-06 11:52:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-06 11:52:01,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:52:01,059 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:52:01,075 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-04-06 11:52:01,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-06 11:52:01,274 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:52:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:52:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-04-06 11:52:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:52:01,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726919249] [2022-04-06 11:52:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:52:01,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:52:01,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142192637] [2022-04-06 11:52:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:01,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:01,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:52:01,286 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-04-06 11:52:01,287 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-04-06 11:52:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:52:01,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-06 11:52:01,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:52:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 11:52:01,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:52:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 11:52:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:52:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726919249] [2022-04-06 11:52:01,603 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:52:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142192637] [2022-04-06 11:52:01,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142192637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:52:01,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:52:01,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-06 11:52:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431660119] [2022-04-06 11:52:01,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:52:01,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-06 11:52:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:52:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-06 11:52:01,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-06 11:52:01,604 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-06 11:52:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:52:02,161 INFO L93 Difference]: Finished difference Result 2565 states and 3679 transitions. [2022-04-06 11:52:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-06 11:52:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-06 11:52:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:52:02,169 INFO L225 Difference]: With dead ends: 2565 [2022-04-06 11:52:02,169 INFO L226 Difference]: Without dead ends: 2543 [2022-04-06 11:52:02,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-04-06 11:52:02,170 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 385 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:52:02,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 488 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 11:52:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-04-06 11:52:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-04-06 11:52:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-06 11:52:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-04-06 11:52:02,450 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-04-06 11:52:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:52:02,450 INFO L478 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-04-06 11:52:02,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-06 11:52:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-04-06 11:52:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-06 11:52:02,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:52:02,451 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1, 1, 1, 1] [2022-04-06 11:52:02,468 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-04-06 11:52:02,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-06 11:52:02,663 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:52:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:52:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-04-06 11:52:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:52:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388392066] [2022-04-06 11:52:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:52:02,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:52:02,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328909767] [2022-04-06 11:52:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:02,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:52:02,679 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-04-06 11:52:02,688 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-04-06 11:52:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:52:02,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-06 11:52:02,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:52:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-06 11:52:02,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:52:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-06 11:52:03,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:52:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388392066] [2022-04-06 11:52:03,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:52:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328909767] [2022-04-06 11:52:03,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328909767] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-06 11:52:03,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 11:52:03,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-06 11:52:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475516660] [2022-04-06 11:52:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:52:03,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:52:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:52:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:52:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-06 11:52:03,051 INFO L87 Difference]: Start difference. First operand 2406 states and 3425 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-06 11:52:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:52:03,377 INFO L93 Difference]: Finished difference Result 2467 states and 3485 transitions. [2022-04-06 11:52:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 11:52:03,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-06 11:52:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:52:03,385 INFO L225 Difference]: With dead ends: 2467 [2022-04-06 11:52:03,385 INFO L226 Difference]: Without dead ends: 2465 [2022-04-06 11:52:03,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-06 11:52:03,386 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:52:03,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:52:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-04-06 11:52:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-04-06 11:52:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-06 11:52:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-04-06 11:52:03,715 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-04-06 11:52:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:52:03,715 INFO L478 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-04-06 11:52:03,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-06 11:52:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-04-06 11:52:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-06 11:52:03,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:52:03,719 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1] [2022-04-06 11:52:03,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-06 11:52:03,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:03,931 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:52:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:52:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-04-06 11:52:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:52:03,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336234402] [2022-04-06 11:52:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:52:03,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:52:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520637552] [2022-04-06 11:52:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:03,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:03,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:52:03,942 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:52:03,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-06 11:52:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:52:03,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-06 11:52:03,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:52:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-06 11:52:04,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:52:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:52:04,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336234402] [2022-04-06 11:52:04,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:52:04,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520637552] [2022-04-06 11:52:04,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520637552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:52:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:52:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 11:52:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454855490] [2022-04-06 11:52:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:52:04,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 11:52:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:52:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 11:52:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 11:52:04,081 INFO L87 Difference]: Start difference. First operand 2442 states and 3450 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-06 11:52:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:52:04,370 INFO L93 Difference]: Finished difference Result 4377 states and 6175 transitions. [2022-04-06 11:52:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 11:52:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-06 11:52:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:52:04,377 INFO L225 Difference]: With dead ends: 4377 [2022-04-06 11:52:04,378 INFO L226 Difference]: Without dead ends: 2578 [2022-04-06 11:52:04,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:52:04,381 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:52:04,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:52:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-04-06 11:52:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-04-06 11:52:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-06 11:52:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-04-06 11:52:04,649 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-04-06 11:52:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:52:04,649 INFO L478 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-04-06 11:52:04,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-06 11:52:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-04-06 11:52:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-06 11:52:04,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:52:04,650 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-06 11:52:04,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-06 11:52:04,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:04,866 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:52:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:52:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-04-06 11:52:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:52:04,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032400988] [2022-04-06 11:52:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:52:04,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:52:04,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648869785] [2022-04-06 11:52:04,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:52:04,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:52:04,892 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:52:04,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-06 11:52:04,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:52:04,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:52:04,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-06 11:52:04,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:52:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-06 11:52:05,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:52:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-06 11:52:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:52:07,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032400988] [2022-04-06 11:52:07,011 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:52:07,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648869785] [2022-04-06 11:52:07,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648869785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:52:07,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:52:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-06 11:52:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189946418] [2022-04-06 11:52:07,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:52:07,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-06 11:52:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:52:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-06 11:52:07,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-06 11:52:07,012 INFO L87 Difference]: Start difference. First operand 2372 states and 3297 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-06 11:52:15,795 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-04-06 11:52:21,169 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-04-06 11:52:23,224 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-04-06 11:52:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:52:25,723 INFO L93 Difference]: Finished difference Result 2869 states and 3894 transitions. [2022-04-06 11:52:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-06 11:52:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-06 11:52:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:52:25,733 INFO L225 Difference]: With dead ends: 2869 [2022-04-06 11:52:25,733 INFO L226 Difference]: Without dead ends: 2863 [2022-04-06 11:52:25,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-04-06 11:52:25,735 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 297 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 303 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:52:25,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 660 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1213 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2022-04-06 11:52:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-04-06 11:52:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-04-06 11:52:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-06 11:52:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-04-06 11:52:26,071 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-04-06 11:52:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:52:26,071 INFO L478 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-04-06 11:52:26,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-06 11:52:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-04-06 11:52:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-06 11:52:26,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:52:26,072 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-04-06 11:52:26,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-06 11:52:26,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-06 11:52:26,283 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:52:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:52:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-04-06 11:52:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:52:26,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801229619] [2022-04-06 11:52:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:52:26,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:52:26,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766910686] [2022-04-06 11:52:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:52:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:52:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:52:26,299 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:52:26,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-06 11:52:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:52:26,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-06 11:52:26,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:52:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-06 11:52:27,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:52:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-06 11:52:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:52:33,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801229619] [2022-04-06 11:52:33,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:52:33,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766910686] [2022-04-06 11:52:33,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766910686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:52:33,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:52:33,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-06 11:52:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128670354] [2022-04-06 11:52:33,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:52:33,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-06 11:52:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:52:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-06 11:52:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-06 11:52:33,341 INFO L87 Difference]: Start difference. First operand 2736 states and 3745 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-06 11:52:44,810 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-04-06 11:52:50,819 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-04-06 11:53:01,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:53:10,059 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-04-06 11:53:14,696 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-04-06 11:53:18,451 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-04-06 11:53:25,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:53:26,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:53:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:53:40,566 INFO L93 Difference]: Finished difference Result 3339 states and 4510 transitions. [2022-04-06 11:53:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-06 11:53:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-06 11:53:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:53:40,576 INFO L225 Difference]: With dead ends: 3339 [2022-04-06 11:53:40,577 INFO L226 Difference]: Without dead ends: 3308 [2022-04-06 11:53:40,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3708 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=1727, Invalid=8985, Unknown=0, NotChecked=0, Total=10712 [2022-04-06 11:53:40,579 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 404 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 511 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2022-04-06 11:53:40,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 938 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1802 Invalid, 5 Unknown, 0 Unchecked, 25.8s Time] [2022-04-06 11:53:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-04-06 11:53:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3022. [2022-04-06 11:53:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-06 11:53:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4123 transitions. [2022-04-06 11:53:41,144 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4123 transitions. Word has length 88 [2022-04-06 11:53:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:53:41,144 INFO L478 AbstractCegarLoop]: Abstraction has 3022 states and 4123 transitions. [2022-04-06 11:53:41,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-06 11:53:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4123 transitions. [2022-04-06 11:53:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-06 11:53:41,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:53:41,146 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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-04-06 11:53:41,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-06 11:53:41,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-06 11:53:41,362 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:53:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:53:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-04-06 11:53:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:53:41,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786260583] [2022-04-06 11:53:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:53:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:53:41,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:53:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939363538] [2022-04-06 11:53:41,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:53:41,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:53:41,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:53:41,370 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:53:41,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-06 11:53:41,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-06 11:53:41,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:53:41,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-06 11:53:41,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:53:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-06 11:53:41,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:53:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-06 11:53:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:53:42,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786260583] [2022-04-06 11:53:42,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:53:42,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939363538] [2022-04-06 11:53:42,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939363538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:53:42,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:53:42,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-06 11:53:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576278311] [2022-04-06 11:53:42,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:53:42,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-06 11:53:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:53:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-06 11:53:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-06 11:53:42,243 INFO L87 Difference]: Start difference. First operand 3022 states and 4123 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-06 11:53:45,997 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-04-06 11:53:50,106 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-04-06 11:53:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:53:51,429 INFO L93 Difference]: Finished difference Result 3251 states and 4437 transitions. [2022-04-06 11:53:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-06 11:53:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-04-06 11:53:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:53:51,438 INFO L225 Difference]: With dead ends: 3251 [2022-04-06 11:53:51,438 INFO L226 Difference]: Without dead ends: 3239 [2022-04-06 11:53:51,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-04-06 11:53:51,439 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 134 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-06 11:53:51,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 478 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 618 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-04-06 11:53:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-04-06 11:53:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 2949. [2022-04-06 11:53:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-04-06 11:53:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4028 transitions. [2022-04-06 11:53:52,001 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4028 transitions. Word has length 97 [2022-04-06 11:53:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:53:52,001 INFO L478 AbstractCegarLoop]: Abstraction has 2949 states and 4028 transitions. [2022-04-06 11:53:52,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-06 11:53:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4028 transitions. [2022-04-06 11:53:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-06 11:53:52,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:53:52,003 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2022-04-06 11:53:52,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-06 11:53:52,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:53:52,219 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:53:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:53:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1037830812, now seen corresponding path program 1 times [2022-04-06 11:53:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:53:52,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489674700] [2022-04-06 11:53:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:53:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:53:52,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:53:52,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324893059] [2022-04-06 11:53:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:53:52,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:53:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:53:52,226 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:53:52,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-06 11:53:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:53:52,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-06 11:53:52,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:53:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-06 11:53:52,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:53:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-06 11:53:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:53:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489674700] [2022-04-06 11:53:52,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:53:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324893059] [2022-04-06 11:53:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324893059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:53:52,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:53:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-06 11:53:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383249451] [2022-04-06 11:53:52,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:53:52,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-06 11:53:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:53:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-06 11:53:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-06 11:53:52,724 INFO L87 Difference]: Start difference. First operand 2949 states and 4028 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-06 11:53:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:53:54,325 INFO L93 Difference]: Finished difference Result 6529 states and 9288 transitions. [2022-04-06 11:53:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-06 11:53:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-04-06 11:53:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:53:54,343 INFO L225 Difference]: With dead ends: 6529 [2022-04-06 11:53:54,343 INFO L226 Difference]: Without dead ends: 5495 [2022-04-06 11:53:54,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-04-06 11:53:54,346 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 540 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:53:54,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 741 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 11:53:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2022-04-06 11:53:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5193. [2022-04-06 11:53:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-04-06 11:53:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7184 transitions. [2022-04-06 11:53:55,423 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7184 transitions. Word has length 98 [2022-04-06 11:53:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:53:55,423 INFO L478 AbstractCegarLoop]: Abstraction has 5193 states and 7184 transitions. [2022-04-06 11:53:55,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-06 11:53:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7184 transitions. [2022-04-06 11:53:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-06 11:53:55,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:53:55,425 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:53:55,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-06 11:53:55,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:53:55,639 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:53:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:53:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2067527905, now seen corresponding path program 2 times [2022-04-06 11:53:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:53:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311337835] [2022-04-06 11:53:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:53:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:53:55,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:53:55,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203998043] [2022-04-06 11:53:55,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:53:55,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:53:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:53:55,656 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:53:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-06 11:53:55,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:53:55,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:53:55,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-06 11:53:55,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:53:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-06 11:53:56,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:53:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-04-06 11:53:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:53:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311337835] [2022-04-06 11:53:57,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:53:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203998043] [2022-04-06 11:53:57,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203998043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:53:57,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:53:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-06 11:53:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343713711] [2022-04-06 11:53:57,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:53:57,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-06 11:53:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:53:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-06 11:53:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-04-06 11:53:57,620 INFO L87 Difference]: Start difference. First operand 5193 states and 7184 transitions. Second operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-06 11:54:00,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 11:54:02,421 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-04-06 11:54:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:54:07,090 INFO L93 Difference]: Finished difference Result 6197 states and 8558 transitions. [2022-04-06 11:54:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-06 11:54:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-04-06 11:54:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:54:07,106 INFO L225 Difference]: With dead ends: 6197 [2022-04-06 11:54:07,106 INFO L226 Difference]: Without dead ends: 6191 [2022-04-06 11:54:07,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-04-06 11:54:07,107 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 203 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 305 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-06 11:54:07,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 777 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1439 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-04-06 11:54:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2022-04-06 11:54:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5573. [2022-04-06 11:54:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-04-06 11:54:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7780 transitions. [2022-04-06 11:54:08,374 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7780 transitions. Word has length 108 [2022-04-06 11:54:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:54:08,374 INFO L478 AbstractCegarLoop]: Abstraction has 5573 states and 7780 transitions. [2022-04-06 11:54:08,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-06 11:54:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7780 transitions. [2022-04-06 11:54:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-06 11:54:08,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:54:08,376 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1] [2022-04-06 11:54:08,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-06 11:54:08,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-06 11:54:08,591 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:54:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:54:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash -55503749, now seen corresponding path program 1 times [2022-04-06 11:54:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:54:08,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938655695] [2022-04-06 11:54:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:54:08,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:54:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222048393] [2022-04-06 11:54:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:54:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:54:08,600 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:54:08,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-06 11:54:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:54:08,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 11:54:08,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:54:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-06 11:54:08,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:54:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-06 11:54:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:54:09,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938655695] [2022-04-06 11:54:09,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:54:09,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222048393] [2022-04-06 11:54:09,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222048393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:54:09,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:54:09,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-06 11:54:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984797455] [2022-04-06 11:54:09,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:54:09,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 11:54:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:54:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 11:54:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-06 11:54:09,109 INFO L87 Difference]: Start difference. First operand 5573 states and 7780 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-06 11:54:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:54:11,083 INFO L93 Difference]: Finished difference Result 9286 states and 13116 transitions. [2022-04-06 11:54:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-06 11:54:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-04-06 11:54:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:54:11,095 INFO L225 Difference]: With dead ends: 9286 [2022-04-06 11:54:11,095 INFO L226 Difference]: Without dead ends: 6132 [2022-04-06 11:54:11,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=708, Invalid=1272, Unknown=0, NotChecked=0, Total=1980 [2022-04-06 11:54:11,101 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 688 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 11:54:11,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 572 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 11:54:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2022-04-06 11:54:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6001. [2022-04-06 11:54:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 3918 states have (on average 1.2021439509954057) internal successors, (4710), 3936 states have internal predecessors, (4710), 1705 states have call successors, (1705), 379 states have call predecessors, (1705), 377 states have return successors, (1703), 1685 states have call predecessors, (1703), 1703 states have call successors, (1703) [2022-04-06 11:54:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 8118 transitions. [2022-04-06 11:54:12,609 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 8118 transitions. Word has length 105 [2022-04-06 11:54:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:54:12,609 INFO L478 AbstractCegarLoop]: Abstraction has 6001 states and 8118 transitions. [2022-04-06 11:54:12,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-06 11:54:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 8118 transitions. [2022-04-06 11:54:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-06 11:54:12,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:54:12,627 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:54:12,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-06 11:54:12,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-06 11:54:12,828 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:54:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:54:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1765875055, now seen corresponding path program 2 times [2022-04-06 11:54:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:54:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127466306] [2022-04-06 11:54:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:54:12,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:54:12,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953341769] [2022-04-06 11:54:12,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:54:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:54:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:54:12,856 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:54:12,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-06 11:54:12,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:54:12,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:54:12,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-06 11:54:12,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:54:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-04-06 11:54:13,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:54:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-06 11:54:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:54:13,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127466306] [2022-04-06 11:54:13,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:54:13,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953341769] [2022-04-06 11:54:13,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953341769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:54:13,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:54:13,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-06 11:54:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63495017] [2022-04-06 11:54:13,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:54:13,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-06 11:54:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:54:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-06 11:54:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 11:54:13,701 INFO L87 Difference]: Start difference. First operand 6001 states and 8118 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-06 11:54:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:54:17,233 INFO L93 Difference]: Finished difference Result 11127 states and 15741 transitions. [2022-04-06 11:54:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-06 11:54:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2022-04-06 11:54:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:54:17,256 INFO L225 Difference]: With dead ends: 11127 [2022-04-06 11:54:17,256 INFO L226 Difference]: Without dead ends: 11122 [2022-04-06 11:54:17,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1327, Invalid=2333, Unknown=0, NotChecked=0, Total=3660 [2022-04-06 11:54:17,260 INFO L913 BasicCegarLoop]: 149 mSDtfsCounter, 947 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 11:54:17,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [947 Valid, 762 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 11:54:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11122 states. [2022-04-06 11:54:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11122 to 10698. [2022-04-06 11:54:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10698 states, 7220 states have (on average 1.2674515235457064) internal successors, (9151), 7305 states have internal predecessors, (9151), 2921 states have call successors, (2921), 558 states have call predecessors, (2921), 556 states have return successors, (2919), 2834 states have call predecessors, (2919), 2919 states have call successors, (2919) [2022-04-06 11:54:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10698 states to 10698 states and 14991 transitions. [2022-04-06 11:54:19,845 INFO L78 Accepts]: Start accepts. Automaton has 10698 states and 14991 transitions. Word has length 132 [2022-04-06 11:54:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:54:19,845 INFO L478 AbstractCegarLoop]: Abstraction has 10698 states and 14991 transitions. [2022-04-06 11:54:19,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-06 11:54:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10698 states and 14991 transitions. [2022-04-06 11:54:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-06 11:54:19,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:54:19,852 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:54:19,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-06 11:54:20,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-06 11:54:20,069 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:54:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:54:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1872087437, now seen corresponding path program 1 times [2022-04-06 11:54:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:54:20,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674311833] [2022-04-06 11:54:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:54:20,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:54:20,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993918366] [2022-04-06 11:54:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:54:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:54:20,083 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:54:20,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-06 11:54:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:54:20,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-06 11:54:20,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:54:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 897 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-04-06 11:54:20,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:54:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 257 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-06 11:54:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:54:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674311833] [2022-04-06 11:54:21,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:54:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993918366] [2022-04-06 11:54:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993918366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:54:21,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:54:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-06 11:54:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020088654] [2022-04-06 11:54:21,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:54:21,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-06 11:54:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:54:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-06 11:54:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-06 11:54:21,205 INFO L87 Difference]: Start difference. First operand 10698 states and 14991 transitions. Second operand has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-04-06 11:54:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:54:26,119 INFO L93 Difference]: Finished difference Result 18017 states and 25879 transitions. [2022-04-06 11:54:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-04-06 11:54:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 196 [2022-04-06 11:54:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:54:26,157 INFO L225 Difference]: With dead ends: 18017 [2022-04-06 11:54:26,157 INFO L226 Difference]: Without dead ends: 15306 [2022-04-06 11:54:26,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2609, Invalid=4531, Unknown=0, NotChecked=0, Total=7140 [2022-04-06 11:54:26,166 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 1659 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-06 11:54:26,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1659 Valid, 1324 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-06 11:54:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15306 states. [2022-04-06 11:54:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15306 to 14953. [2022-04-06 11:54:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14953 states, 9776 states have (on average 1.2580810147299508) internal successors, (12299), 9831 states have internal predecessors, (12299), 4339 states have call successors, (4339), 839 states have call predecessors, (4339), 837 states have return successors, (4337), 4282 states have call predecessors, (4337), 4337 states have call successors, (4337) [2022-04-06 11:54:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14953 states to 14953 states and 20975 transitions. [2022-04-06 11:54:29,961 INFO L78 Accepts]: Start accepts. Automaton has 14953 states and 20975 transitions. Word has length 196 [2022-04-06 11:54:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:54:29,962 INFO L478 AbstractCegarLoop]: Abstraction has 14953 states and 20975 transitions. [2022-04-06 11:54:29,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-04-06 11:54:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14953 states and 20975 transitions. [2022-04-06 11:54:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-06 11:54:29,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:54:29,970 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:54:29,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-06 11:54:30,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-06 11:54:30,187 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:54:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:54:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2139737637, now seen corresponding path program 2 times [2022-04-06 11:54:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:54:30,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726615349] [2022-04-06 11:54:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:54:30,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:54:30,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613403077] [2022-04-06 11:54:30,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:54:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:54:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:54:30,197 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:54:30,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-06 11:54:30,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:54:30,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:54:30,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-06 11:54:30,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:54:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 950 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-04-06 11:54:30,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:54:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 310 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-06 11:54:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:54:31,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726615349] [2022-04-06 11:54:31,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:54:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613403077] [2022-04-06 11:54:31,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613403077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:54:31,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:54:31,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-06 11:54:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808233510] [2022-04-06 11:54:31,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:54:31,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-06 11:54:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:54:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-06 11:54:31,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-06 11:54:31,562 INFO L87 Difference]: Start difference. First operand 14953 states and 20975 transitions. Second operand has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-04-06 11:54:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:54:37,159 INFO L93 Difference]: Finished difference Result 22942 states and 32447 transitions. [2022-04-06 11:54:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-06 11:54:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 207 [2022-04-06 11:54:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:54:37,230 INFO L225 Difference]: With dead ends: 22942 [2022-04-06 11:54:37,230 INFO L226 Difference]: Without dead ends: 15900 [2022-04-06 11:54:37,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3132, Invalid=5424, Unknown=0, NotChecked=0, Total=8556 [2022-04-06 11:54:37,249 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 1582 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-06 11:54:37,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 1390 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-06 11:54:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15900 states. [2022-04-06 11:54:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15900 to 15657. [2022-04-06 11:54:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15657 states, 9902 states have (on average 1.188547768127651) internal successors, (11769), 9944 states have internal predecessors, (11769), 4825 states have call successors, (4825), 931 states have call predecessors, (4825), 929 states have return successors, (4823), 4781 states have call predecessors, (4823), 4823 states have call successors, (4823) [2022-04-06 11:54:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 21417 transitions. [2022-04-06 11:54:41,436 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 21417 transitions. Word has length 207 [2022-04-06 11:54:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:54:41,436 INFO L478 AbstractCegarLoop]: Abstraction has 15657 states and 21417 transitions. [2022-04-06 11:54:41,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-04-06 11:54:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 21417 transitions. [2022-04-06 11:54:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-04-06 11:54:41,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:54:41,448 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 15, 15, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:54:41,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-06 11:54:41,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-06 11:54:41,665 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:54:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:54:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -777184055, now seen corresponding path program 3 times [2022-04-06 11:54:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:54:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420714170] [2022-04-06 11:54:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:54:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:54:41,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:54:41,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067309623] [2022-04-06 11:54:41,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:54:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:54:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:54:41,676 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:54:41,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-06 11:55:20,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-06 11:55:20,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:55:20,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-06 11:55:20,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:55:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 1955 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-06 11:55:20,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:55:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 611 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2022-04-06 11:55:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:55:21,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420714170] [2022-04-06 11:55:21,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:55:21,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067309623] [2022-04-06 11:55:21,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067309623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:55:21,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:55:21,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-06 11:55:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353913685] [2022-04-06 11:55:21,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:55:21,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 11:55:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:55:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 11:55:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 11:55:21,665 INFO L87 Difference]: Start difference. First operand 15657 states and 21417 transitions. Second operand has 54 states, 54 states have (on average 4.722222222222222) internal successors, (255), 54 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-04-06 11:55:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:55:28,256 INFO L93 Difference]: Finished difference Result 18269 states and 25239 transitions. [2022-04-06 11:55:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-04-06 11:55:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.722222222222222) internal successors, (255), 54 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) Word has length 268 [2022-04-06 11:55:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:55:28,287 INFO L225 Difference]: With dead ends: 18269 [2022-04-06 11:55:28,287 INFO L226 Difference]: Without dead ends: 18264 [2022-04-06 11:55:28,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3713, Invalid=6387, Unknown=0, NotChecked=0, Total=10100 [2022-04-06 11:55:28,293 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 1842 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 1404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1404 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:55:28,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1842 Valid, 1221 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1404 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-06 11:55:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18264 states. [2022-04-06 11:55:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18264 to 17885. [2022-04-06 11:55:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17885 states, 11463 states have (on average 1.2023902992235889) internal successors, (13783), 11552 states have internal predecessors, (13783), 5405 states have call successors, (5405), 1018 states have call predecessors, (5405), 1016 states have return successors, (5403), 5314 states have call predecessors, (5403), 5403 states have call successors, (5403) [2022-04-06 11:55:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17885 states to 17885 states and 24591 transitions. [2022-04-06 11:55:32,755 INFO L78 Accepts]: Start accepts. Automaton has 17885 states and 24591 transitions. Word has length 268 [2022-04-06 11:55:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:55:32,756 INFO L478 AbstractCegarLoop]: Abstraction has 17885 states and 24591 transitions. [2022-04-06 11:55:32,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.722222222222222) internal successors, (255), 54 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-04-06 11:55:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 17885 states and 24591 transitions. [2022-04-06 11:55:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-04-06 11:55:32,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:55:32,779 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 40, 22, 21, 13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:55:32,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-06 11:55:32,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:55:32,988 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:55:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:55:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2114344233, now seen corresponding path program 2 times [2022-04-06 11:55:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:55:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315047495] [2022-04-06 11:55:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:55:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:55:32,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:55:32,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65715224] [2022-04-06 11:55:32,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 11:55:32,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:55:32,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:55:32,998 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:55:32,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-06 11:55:33,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 11:55:33,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:55:33,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-06 11:55:33,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:55:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 4165 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-06 11:55:34,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:55:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 1285 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2022-04-06 11:55:34,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:55:34,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315047495] [2022-04-06 11:55:34,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:55:34,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65715224] [2022-04-06 11:55:34,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65715224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:55:34,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:55:34,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2022-04-06 11:55:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477357726] [2022-04-06 11:55:34,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:55:34,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 11:55:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:55:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 11:55:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 11:55:34,962 INFO L87 Difference]: Start difference. First operand 17885 states and 24591 transitions. Second operand has 54 states, 54 states have (on average 5.907407407407407) internal successors, (319), 54 states have internal predecessors, (319), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-04-06 11:55:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:55:41,197 INFO L93 Difference]: Finished difference Result 19131 states and 26390 transitions. [2022-04-06 11:55:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-04-06 11:55:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.907407407407407) internal successors, (319), 54 states have internal predecessors, (319), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) Word has length 377 [2022-04-06 11:55:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:55:41,228 INFO L225 Difference]: With dead ends: 19131 [2022-04-06 11:55:41,229 INFO L226 Difference]: Without dead ends: 17432 [2022-04-06 11:55:41,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 700 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3724, Invalid=6376, Unknown=0, NotChecked=0, Total=10100 [2022-04-06 11:55:41,236 INFO L913 BasicCegarLoop]: 229 mSDtfsCounter, 1587 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-06 11:55:41,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 1192 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-06 11:55:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17432 states. [2022-04-06 11:55:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17432 to 17325. [2022-04-06 11:55:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17325 states, 10956 states have (on average 1.1849215041986125) internal successors, (12982), 11003 states have internal predecessors, (12982), 5347 states have call successors, (5347), 1023 states have call predecessors, (5347), 1021 states have return successors, (5345), 5298 states have call predecessors, (5345), 5345 states have call successors, (5345) [2022-04-06 11:55:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17325 states to 17325 states and 23674 transitions. [2022-04-06 11:55:45,730 INFO L78 Accepts]: Start accepts. Automaton has 17325 states and 23674 transitions. Word has length 377 [2022-04-06 11:55:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:55:45,730 INFO L478 AbstractCegarLoop]: Abstraction has 17325 states and 23674 transitions. [2022-04-06 11:55:45,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.907407407407407) internal successors, (319), 54 states have internal predecessors, (319), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-04-06 11:55:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17325 states and 23674 transitions. [2022-04-06 11:55:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-04-06 11:55:45,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:55:45,750 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 24, 24, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:55:45,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-06 11:55:45,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-06 11:55:45,967 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:55:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:55:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2036089593, now seen corresponding path program 3 times [2022-04-06 11:55:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:55:45,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070879154] [2022-04-06 11:55:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:55:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:55:45,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:55:45,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79879699] [2022-04-06 11:55:45,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 11:55:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:55:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:55:45,979 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:55:45,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-06 11:55:46,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-06 11:55:46,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 11:55:46,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-06 11:55:46,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:55:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5477 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-04-06 11:55:46,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 11:55:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:55:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070879154] [2022-04-06 11:55:46,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:55:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79879699] [2022-04-06 11:55:46,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79879699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 11:55:46,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 11:55:46,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 11:55:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627106123] [2022-04-06 11:55:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 11:55:46,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 11:55:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:55:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 11:55:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 11:55:46,507 INFO L87 Difference]: Start difference. First operand 17325 states and 23674 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-06 11:55:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:55:51,028 INFO L93 Difference]: Finished difference Result 18542 states and 25445 transitions. [2022-04-06 11:55:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 11:55:51,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 411 [2022-04-06 11:55:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:55:51,057 INFO L225 Difference]: With dead ends: 18542 [2022-04-06 11:55:51,058 INFO L226 Difference]: Without dead ends: 17905 [2022-04-06 11:55:51,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 11:55:51,062 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 31 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 11:55:51,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 208 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 11:55:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17905 states. [2022-04-06 11:55:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17905 to 17494. [2022-04-06 11:55:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17494 states, 11013 states have (on average 1.183782802142922) internal successors, (13037), 11057 states have internal predecessors, (13037), 5433 states have call successors, (5433), 1049 states have call predecessors, (5433), 1047 states have return successors, (5431), 5387 states have call predecessors, (5431), 5431 states have call successors, (5431) [2022-04-06 11:55:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17494 states to 17494 states and 23901 transitions. [2022-04-06 11:55:55,565 INFO L78 Accepts]: Start accepts. Automaton has 17494 states and 23901 transitions. Word has length 411 [2022-04-06 11:55:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:55:55,565 INFO L478 AbstractCegarLoop]: Abstraction has 17494 states and 23901 transitions. [2022-04-06 11:55:55,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-06 11:55:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 17494 states and 23901 transitions. [2022-04-06 11:55:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-04-06 11:55:55,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:55:55,587 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 25, 25, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:55:55,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-06 11:55:55,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:55:55,802 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:55:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:55:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2109653093, now seen corresponding path program 1 times [2022-04-06 11:55:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:55:55,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479988306] [2022-04-06 11:55:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:55:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:55:55,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:55:55,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823743048] [2022-04-06 11:55:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:55:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:55:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:55:55,814 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:55:55,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-06 11:55:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 11:55:55,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-06 11:55:55,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 11:55:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5573 backedges. 307 proven. 4994 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-04-06 11:55:57,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 11:55:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5573 backedges. 307 proven. 1474 refuted. 0 times theorem prover too weak. 3792 trivial. 0 not checked. [2022-04-06 11:55:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 11:55:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479988306] [2022-04-06 11:55:57,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 11:55:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823743048] [2022-04-06 11:55:57,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823743048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 11:55:57,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 11:55:57,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-06 11:55:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954553847] [2022-04-06 11:55:57,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 11:55:57,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 11:55:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 11:55:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 11:55:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 11:55:57,720 INFO L87 Difference]: Start difference. First operand 17494 states and 23901 transitions. Second operand has 54 states, 54 states have (on average 7.166666666666667) internal successors, (387), 54 states have internal predecessors, (387), 25 states have call successors, (96), 14 states have call predecessors, (96), 13 states have return successors, (94), 23 states have call predecessors, (94), 24 states have call successors, (94) [2022-04-06 11:56:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 11:56:03,796 INFO L93 Difference]: Finished difference Result 17806 states and 24335 transitions. [2022-04-06 11:56:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-04-06 11:56:03,797 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.166666666666667) internal successors, (387), 54 states have internal predecessors, (387), 25 states have call successors, (96), 14 states have call predecessors, (96), 13 states have return successors, (94), 23 states have call predecessors, (94), 24 states have call successors, (94) Word has length 416 [2022-04-06 11:56:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 11:56:03,824 INFO L225 Difference]: With dead ends: 17806 [2022-04-06 11:56:03,824 INFO L226 Difference]: Without dead ends: 17412 [2022-04-06 11:56:03,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 778 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3726, Invalid=6374, Unknown=0, NotChecked=0, Total=10100 [2022-04-06 11:56:03,829 INFO L913 BasicCegarLoop]: 229 mSDtfsCounter, 1757 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 1213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1213 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-06 11:56:03,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1757 Valid, 1169 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1213 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-06 11:56:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17412 states. [2022-04-06 11:56:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17412 to 17412. [2022-04-06 11:56:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17412 states, 10973 states have (on average 1.1740636106807618) internal successors, (12883), 11016 states have internal predecessors, (12883), 5403 states have call successors, (5403), 1037 states have call predecessors, (5403), 1035 states have return successors, (5401), 5358 states have call predecessors, (5401), 5401 states have call successors, (5401) [2022-04-06 11:56:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23687 transitions. [2022-04-06 11:56:08,294 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23687 transitions. Word has length 416 [2022-04-06 11:56:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 11:56:08,295 INFO L478 AbstractCegarLoop]: Abstraction has 17412 states and 23687 transitions. [2022-04-06 11:56:08,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.166666666666667) internal successors, (387), 54 states have internal predecessors, (387), 25 states have call successors, (96), 14 states have call predecessors, (96), 13 states have return successors, (94), 23 states have call predecessors, (94), 24 states have call successors, (94) [2022-04-06 11:56:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23687 transitions. [2022-04-06 11:56:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2022-04-06 11:56:08,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 11:56:08,315 INFO L499 BasicCegarLoop]: trace histogram [49, 48, 48, 25, 25, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:56:08,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-06 11:56:08,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:56:08,533 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 11:56:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 11:56:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1640866097, now seen corresponding path program 4 times [2022-04-06 11:56:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 11:56:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016117073] [2022-04-06 11:56:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 11:56:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 11:56:08,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 11:56:08,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962348863] [2022-04-06 11:56:08,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 11:56:08,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 11:56:08,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 11:56:08,546 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 11:56:08,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-06 11:56:10,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 11:56:10,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-06 11:56:10,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 11:56:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 11:56:11,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 11:56:11,021 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 11:56:11,022 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 11:56:11,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-06 11:56:11,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-06 11:56:11,233 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 11:56:11,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 11:56:11,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:56:11 BasicIcfg [2022-04-06 11:56:11,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 11:56:11,355 INFO L158 Benchmark]: Toolchain (without parser) took 268334.57ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 197.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 11:56:11,355 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 11:56:11,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.31ms. Allocated memory is still 229.6MB. Free memory was 197.6MB in the beginning and 201.8MB in the end (delta: -4.3MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-06 11:56:11,358 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 229.6MB. Free memory was 201.5MB in the beginning and 200.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 11:56:11,358 INFO L158 Benchmark]: RCFGBuilder took 199.25ms. Allocated memory is still 229.6MB. Free memory was 200.2MB in the beginning and 188.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 11:56:11,359 INFO L158 Benchmark]: IcfgTransformer took 15.28ms. Allocated memory is still 229.6MB. Free memory was 188.3MB in the beginning and 186.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 11:56:11,360 INFO L158 Benchmark]: TraceAbstraction took 267929.25ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 186.5MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 11:56:11,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.31ms. Allocated memory is still 229.6MB. Free memory was 197.6MB in the beginning and 201.8MB in the end (delta: -4.3MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 229.6MB. Free memory was 201.5MB in the beginning and 200.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 199.25ms. Allocated memory is still 229.6MB. Free memory was 200.2MB in the beginning and 188.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.28ms. Allocated memory is still 229.6MB. Free memory was 188.3MB in the beginning and 186.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 267929.25ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 186.5MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=53, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=377, y=610] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=377, y=610] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=377, b=610, counter=0, p=1, q=0, r=0, s=1, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=377, b=610, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=377, b=610, c=377, counter=1, k=0, p=1, q=0, r=0, s=1, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=610, c=377, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=610, c=377, counter=2, k=0, p=1, q=0, r=0, s=1, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=610, b=377, c=610, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=610, b=377, c=610, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=610, b=377, c=233, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=377, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=377, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=377, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=377, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=377, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=377, b=233, c=377, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=377, b=233, c=377, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=377, b=233, c=144, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=233, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=233, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=233, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=233, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=12, counter++=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=233, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=233, b=144, c=233, counter=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, counter++=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=233, b=144, c=233, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=233, b=144, c=89, counter=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=14, counter++=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=14, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=144, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=144, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=15, counter++=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=144, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=144, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=16, counter++=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=144, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=144, b=89, c=144, counter=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, counter++=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=144, b=89, c=144, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=144, b=89, c=55, counter=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=18, counter++=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=18, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=89, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=89, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=19, counter++=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=89, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=89, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=20, counter++=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=89, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=89, b=55, c=89, counter=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, counter++=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=89, b=55, c=89, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=89, b=55, c=34, counter=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=22, counter++=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=22, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=55, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=55, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=23, counter++=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=55, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=55, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=24, counter++=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=55, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=55, b=34, c=55, counter=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, counter++=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=55, b=34, c=55, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=55, b=34, c=21, counter=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=26, counter++=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=26, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=34, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=34, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=27, counter++=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=34, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=34, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=28, counter++=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=34, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=34, b=21, c=34, counter=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, counter++=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=34, b=21, c=34, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=34, b=21, c=13, counter=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=30, counter++=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=30, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=21, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=21, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=31, counter++=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=21, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=21, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=32, counter++=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=21, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=21, b=13, c=21, counter=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, counter++=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=21, b=13, c=21, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=21, b=13, c=8, counter=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=34, counter++=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=34, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=13, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=13, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=35, counter++=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=13, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=13, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=36, counter++=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=13, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=13, b=8, c=13, counter=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, counter++=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=13, b=8, c=13, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=13, b=8, c=5, counter=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=38, counter++=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=38, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=8, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=8, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=39, counter++=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=8, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=8, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=40, counter++=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=8, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=8, b=5, c=8, counter=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, counter++=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=8, b=5, c=8, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=8, b=5, c=3, counter=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=42, counter++=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=42, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=5, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=5, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=43, counter++=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=5, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=5, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=44, counter++=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=5, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, counter++=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=46, counter++=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=46, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=3, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=3, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=47, counter++=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=3, x=377, y=610] [L34] COND TRUE counter++<50 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=3, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=48, counter++=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=3, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, counter++=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L48] COND TRUE counter++<50 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, counter++=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L41] COND TRUE counter++<50 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=2, x=377, y=610] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=2, x=377, y=610] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=51, counter++=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=2, x=377, y=610] [L34] COND FALSE !(counter++<50) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 267.8s, OverallIterations: 34, TraceHistogramMax: 49, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 156.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 13467 SdHoareTripleChecker+Valid, 66.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13390 mSDsluCounter, 16106 SdHoareTripleChecker+Invalid, 64.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13196 mSDsCounter, 9323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15150 IncrementalHoareTripleChecker+Invalid, 24484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9323 mSolverCounterUnsat, 2910 mSDtfsCounter, 15150 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6465 GetRequests, 5386 SyntacticMatches, 20 SemanticMatches, 1059 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13446 ImplicationChecksByTransitivity, 62.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17885occurred in iteration=30, InterpolantAutomatonStates: 1006, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 4748 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 41.3s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 3825 NumberOfCodeBlocks, 3403 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 5912 ConstructedInterpolants, 0 QuantifiedInterpolants, 22742 SizeOfPredicates, 322 NumberOfNonLiveVariables, 9118 ConjunctsInSsa, 989 ConjunctsInUnsatCore, 54 InterpolantComputations, 13 PerfectInterpolantSequences, 20412/38480 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-04-06 11:56:11,404 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...