/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 22:45:10,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 22:45:10,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 22:45:10,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 22:45:10,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 22:45:10,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 22:45:10,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 22:45:10,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 22:45:10,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 22:45:10,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 22:45:10,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 22:45:10,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 22:45:10,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 22:45:10,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 22:45:10,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 22:45:10,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 22:45:10,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 22:45:10,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 22:45:10,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 22:45:10,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 22:45:10,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 22:45:10,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 22:45:10,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 22:45:10,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 22:45:10,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 22:45:10,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 22:45:10,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 22:45:10,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 22:45:10,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 22:45:10,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 22:45:10,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 22:45:10,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 22:45:10,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 22:45:10,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 22:45:10,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 22:45:10,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 22:45:10,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 22:45:10,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 22:45:10,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 22:45:10,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 22:45:10,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 22:45:10,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-23 22:45:10,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 22:45:10,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 22:45:10,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-23 22:45:10,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-23 22:45:10,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-23 22:45:10,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-23 22:45:10,413 INFO L138 SettingsManager]: * Use SBE=true [2022-02-23 22:45:10,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 22:45:10,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 22:45:10,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 22:45:10,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 22:45:10,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 22:45:10,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-23 22:45:10,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-23 22:45:10,416 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 22:45:10,416 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-02-23 22:45:10,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 22:45:10,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 22:45:10,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 22:45:10,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 22:45:10,632 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 22:45:10,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-02-23 22:45:10,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8c71631/064e180597dc455ab74899ffb6a402ab/FLAG5b2b70caf [2022-02-23 22:45:11,059 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 22:45:11,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-02-23 22:45:11,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8c71631/064e180597dc455ab74899ffb6a402ab/FLAG5b2b70caf [2022-02-23 22:45:11,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8c71631/064e180597dc455ab74899ffb6a402ab [2022-02-23 22:45:11,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 22:45:11,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 22:45:11,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 22:45:11,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 22:45:11,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 22:45:11,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef6c758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11, skipping insertion in model container [2022-02-23 22:45:11,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 22:45:11,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 22:45:11,630 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_unwindbound100.c[490,503] [2022-02-23 22:45:11,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 22:45:11,646 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 22:45:11,653 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_unwindbound100.c[490,503] [2022-02-23 22:45:11,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 22:45:11,668 INFO L208 MainTranslator]: Completed translation [2022-02-23 22:45:11,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11 WrapperNode [2022-02-23 22:45:11,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 22:45:11,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 22:45:11,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 22:45:11,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 22:45:11,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 22:45:11,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 22:45:11,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 22:45:11,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 22:45:11,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:11,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 22:45:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:11,713 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-02-23 22:45:11,714 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-02-23 22:45:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 22:45:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 22:45:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 22:45:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-23 22:45:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 22:45:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 22:45:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 22:45:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 22:45:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 22:45:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 22:45:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 22:45:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 22:45:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 22:45:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 22:45:11,786 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 22:45:11,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 22:45:11,949 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 22:45:11,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 22:45:11,970 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-23 22:45:11,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:45:11 BoogieIcfgContainer [2022-02-23 22:45:11,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 22:45:11,972 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 22:45:11,972 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 22:45:11,973 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 22:45:11,975 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:45:11" (1/1) ... [2022-02-23 22:45:12,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 10:45:12 BasicIcfg [2022-02-23 22:45:12,001 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 22:45:12,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 22:45:12,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 22:45:12,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 22:45:12,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 10:45:11" (1/4) ... [2022-02-23 22:45:12,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8a11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:45:12, skipping insertion in model container [2022-02-23 22:45:12,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:45:11" (2/4) ... [2022-02-23 22:45:12,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8a11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:45:12, skipping insertion in model container [2022-02-23 22:45:12,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:45:11" (3/4) ... [2022-02-23 22:45:12,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8a11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 10:45:12, skipping insertion in model container [2022-02-23 22:45:12,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 10:45:12" (4/4) ... [2022-02-23 22:45:12,006 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.cqvasr [2022-02-23 22:45:12,009 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-23 22:45:12,009 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 22:45:12,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 22:45:12,050 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-23 22:45:12,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 22:45:12,092 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-02-23 22:45:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-23 22:45:12,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:12,097 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:45:12,097 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-02-23 22:45:12,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:12,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627723236] [2022-02-23 22:45:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 22:45:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-23 22:45:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-23 22:45:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:12,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:12,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627723236] [2022-02-23 22:45:12,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627723236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:12,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:12,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-23 22:45:12,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726609525] [2022-02-23 22:45:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:12,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-23 22:45:12,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-23 22:45:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-23 22:45:12,271 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-02-23 22:45:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:12,349 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-02-23 22:45:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-23 22:45:12,351 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-02-23 22:45:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:12,358 INFO L225 Difference]: With dead ends: 74 [2022-02-23 22:45:12,358 INFO L226 Difference]: Without dead ends: 36 [2022-02-23 22:45:12,361 INFO L932 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-02-23 22:45:12,363 INFO L933 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-02-23 22:45:12,365 INFO L934 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-02-23 22:45:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-23 22:45:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-02-23 22:45:12,400 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-02-23 22:45:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-02-23 22:45:12,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-02-23 22:45:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:12,402 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-02-23 22:45:12,403 INFO L471 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-02-23 22:45:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-23 22:45:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-23 22:45:12,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:12,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:45:12,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-23 22:45:12,404 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-02-23 22:45:12,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:12,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316622776] [2022-02-23 22:45:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:12,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:12,418 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:12,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616010214] [2022-02-23 22:45:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:12,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:12,420 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-02-23 22:45:12,421 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-02-23 22:45:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 22:45:12,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:12,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:12,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:12,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316622776] [2022-02-23 22:45:12,584 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:12,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616010214] [2022-02-23 22:45:12,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616010214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:12,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:12,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 22:45:12,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962694336] [2022-02-23 22:45:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:12,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 22:45:12,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 22:45:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 22:45:12,587 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-02-23 22:45:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:12,599 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-02-23 22:45:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 22:45:12,600 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-02-23 22:45:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:12,601 INFO L225 Difference]: With dead ends: 44 [2022-02-23 22:45:12,601 INFO L226 Difference]: Without dead ends: 37 [2022-02-23 22:45:12,601 INFO L932 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-02-23 22:45:12,602 INFO L933 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-02-23 22:45:12,602 INFO L934 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-02-23 22:45:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-23 22:45:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-23 22:45:12,612 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-02-23 22:45:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-02-23 22:45:12,613 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-02-23 22:45:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:12,613 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-02-23 22:45:12,613 INFO L471 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-02-23 22:45:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-23 22:45:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-23 22:45:12,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:12,614 INFO L514 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-02-23 22:45:12,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-23 22:45:12,841 WARN L452 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-02-23 22:45:12,841 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-02-23 22:45:12,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:12,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318446803] [2022-02-23 22:45:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:12,861 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:12,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289629910] [2022-02-23 22:45:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:12,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:12,863 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-02-23 22:45:12,864 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-02-23 22:45:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:12,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 22:45:12,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:12,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:12,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:12,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318446803] [2022-02-23 22:45:12,995 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:12,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289629910] [2022-02-23 22:45:12,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289629910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:12,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:12,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 22:45:12,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757844822] [2022-02-23 22:45:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:12,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 22:45:12,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 22:45:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-23 22:45:12,998 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-02-23 22:45:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:13,064 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-02-23 22:45:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 22:45:13,065 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-02-23 22:45:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:13,066 INFO L225 Difference]: With dead ends: 57 [2022-02-23 22:45:13,066 INFO L226 Difference]: Without dead ends: 50 [2022-02-23 22:45:13,066 INFO L932 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-02-23 22:45:13,067 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:13,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 169 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-23 22:45:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-02-23 22:45:13,073 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-02-23 22:45:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-02-23 22:45:13,073 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-02-23 22:45:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:13,074 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-02-23 22:45:13,074 INFO L471 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-02-23 22:45:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-23 22:45:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-23 22:45:13,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:13,075 INFO L514 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-02-23 22:45:13,091 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-02-23 22:45:13,280 WARN L452 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-02-23 22:45:13,280 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:13,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-02-23 22:45:13,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:13,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191913543] [2022-02-23 22:45:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:13,296 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:13,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899723959] [2022-02-23 22:45:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:13,300 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-02-23 22:45:13,303 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-02-23 22:45:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:13,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 22:45:13,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:13,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:13,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:13,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191913543] [2022-02-23 22:45:13,419 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:13,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899723959] [2022-02-23 22:45:13,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899723959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:13,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:13,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 22:45:13,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110629090] [2022-02-23 22:45:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:13,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:13,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-23 22:45:13,422 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-02-23 22:45:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:13,445 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-02-23 22:45:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 22:45:13,445 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-02-23 22:45:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:13,449 INFO L225 Difference]: With dead ends: 62 [2022-02-23 22:45:13,450 INFO L226 Difference]: Without dead ends: 40 [2022-02-23 22:45:13,450 INFO L932 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-02-23 22:45:13,451 INFO L933 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-02-23 22:45:13,451 INFO L934 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-02-23 22:45:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-23 22:45:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-23 22:45:13,456 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-02-23 22:45:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-02-23 22:45:13,456 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-02-23 22:45:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:13,457 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-02-23 22:45:13,457 INFO L471 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-02-23 22:45:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-23 22:45:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-23 22:45:13,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:13,458 INFO L514 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-02-23 22:45:13,476 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-02-23 22:45:13,674 WARN L452 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-02-23 22:45:13,674 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-02-23 22:45:13,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:13,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857133701] [2022-02-23 22:45:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:13,693 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:13,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250245524] [2022-02-23 22:45:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:13,699 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-02-23 22:45:13,700 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-02-23 22:45:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:13,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-23 22:45:13,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:13,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:13,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:13,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857133701] [2022-02-23 22:45:13,938 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:13,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250245524] [2022-02-23 22:45:13,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250245524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:13,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:13,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-23 22:45:13,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357094319] [2022-02-23 22:45:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:13,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 22:45:13,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 22:45:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-23 22:45:13,940 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-02-23 22:45:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:14,077 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-02-23 22:45:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-23 22:45:14,077 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-02-23 22:45:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:14,078 INFO L225 Difference]: With dead ends: 68 [2022-02-23 22:45:14,078 INFO L226 Difference]: Without dead ends: 66 [2022-02-23 22:45:14,079 INFO L932 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-02-23 22:45:14,079 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:14,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 22:45:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-23 22:45:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-02-23 22:45:14,086 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-02-23 22:45:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-02-23 22:45:14,086 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-02-23 22:45:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:14,087 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-02-23 22:45:14,087 INFO L471 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-02-23 22:45:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-02-23 22:45:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-23 22:45:14,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:14,087 INFO L514 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-02-23 22:45:14,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-23 22:45:14,301 WARN L452 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-02-23 22:45:14,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-02-23 22:45:14,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:14,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881474746] [2022-02-23 22:45:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:14,312 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:14,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33885169] [2022-02-23 22:45:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:14,320 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-02-23 22:45:14,331 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-02-23 22:45:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:14,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 22:45:14,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:14,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:14,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:14,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881474746] [2022-02-23 22:45:14,476 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:14,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33885169] [2022-02-23 22:45:14,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33885169] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:14,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:14,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-23 22:45:14,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466392483] [2022-02-23 22:45:14,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:14,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 22:45:14,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 22:45:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-23 22:45:14,478 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-02-23 22:45:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:14,568 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-02-23 22:45:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-23 22:45:14,569 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-02-23 22:45:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:14,570 INFO L225 Difference]: With dead ends: 151 [2022-02-23 22:45:14,570 INFO L226 Difference]: Without dead ends: 144 [2022-02-23 22:45:14,571 INFO L932 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-02-23 22:45:14,571 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-23 22:45:14,572 INFO L934 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-02-23 22:45:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-23 22:45:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-02-23 22:45:14,583 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-02-23 22:45:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-02-23 22:45:14,584 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-02-23 22:45:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:14,584 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-02-23 22:45:14,585 INFO L471 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-02-23 22:45:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-02-23 22:45:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-23 22:45:14,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:14,585 INFO L514 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-02-23 22:45:14,604 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-02-23 22:45:14,786 WARN L452 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-02-23 22:45:14,786 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-02-23 22:45:14,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:14,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088426295] [2022-02-23 22:45:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:14,795 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:14,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927077251] [2022-02-23 22:45:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:14,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:14,797 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-02-23 22:45:14,798 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-02-23 22:45:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:14,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 22:45:14,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:14,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:14,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:14,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088426295] [2022-02-23 22:45:14,963 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:14,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927077251] [2022-02-23 22:45:14,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927077251] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:14,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:14,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-02-23 22:45:14,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500511538] [2022-02-23 22:45:14,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:14,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-23 22:45:14,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-23 22:45:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-23 22:45:14,965 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-02-23 22:45:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:15,110 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-02-23 22:45:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-23 22:45:15,112 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-02-23 22:45:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:15,113 INFO L225 Difference]: With dead ends: 187 [2022-02-23 22:45:15,113 INFO L226 Difference]: Without dead ends: 175 [2022-02-23 22:45:15,114 INFO L932 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-02-23 22:45:15,114 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:15,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 362 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 22:45:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-23 22:45:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-02-23 22:45:15,142 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-02-23 22:45:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-02-23 22:45:15,147 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-02-23 22:45:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:15,147 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-02-23 22:45:15,148 INFO L471 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-02-23 22:45:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-02-23 22:45:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-23 22:45:15,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:15,150 INFO L514 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-02-23 22:45:15,171 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-02-23 22:45:15,363 WARN L452 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-02-23 22:45:15,363 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-02-23 22:45:15,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:15,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036258093] [2022-02-23 22:45:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:15,374 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:15,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127628681] [2022-02-23 22:45:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:15,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:15,376 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-02-23 22:45:15,377 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-02-23 22:45:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:15,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-23 22:45:15,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:15,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:15,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:15,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036258093] [2022-02-23 22:45:15,584 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:15,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127628681] [2022-02-23 22:45:15,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127628681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:15,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:15,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-23 22:45:15,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474213197] [2022-02-23 22:45:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:15,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 22:45:15,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 22:45:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-23 22:45:15,585 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-02-23 22:45:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:15,725 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-02-23 22:45:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-23 22:45:15,726 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-02-23 22:45:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:15,727 INFO L225 Difference]: With dead ends: 157 [2022-02-23 22:45:15,727 INFO L226 Difference]: Without dead ends: 155 [2022-02-23 22:45:15,727 INFO L932 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-02-23 22:45:15,728 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:15,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 269 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 22:45:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-23 22:45:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-02-23 22:45:15,738 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-02-23 22:45:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-02-23 22:45:15,739 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-02-23 22:45:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:15,739 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-02-23 22:45:15,739 INFO L471 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-02-23 22:45:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-02-23 22:45:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-23 22:45:15,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:15,740 INFO L514 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-02-23 22:45:15,756 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-02-23 22:45:15,956 WARN L452 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-02-23 22:45:15,956 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-02-23 22:45:15,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:15,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714387980] [2022-02-23 22:45:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:15,974 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:15,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477582066] [2022-02-23 22:45:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:15,976 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-02-23 22:45:15,977 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-02-23 22:45:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:16,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-23 22:45:16,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 22:45:16,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:16,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:16,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714387980] [2022-02-23 22:45:16,257 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:16,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477582066] [2022-02-23 22:45:16,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477582066] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:16,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:16,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-02-23 22:45:16,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294785076] [2022-02-23 22:45:16,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:16,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-23 22:45:16,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-23 22:45:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-23 22:45:16,258 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-02-23 22:45:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:16,367 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-02-23 22:45:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-23 22:45:16,367 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-02-23 22:45:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:16,368 INFO L225 Difference]: With dead ends: 179 [2022-02-23 22:45:16,368 INFO L226 Difference]: Without dead ends: 177 [2022-02-23 22:45:16,369 INFO L932 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-02-23 22:45:16,369 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:16,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 409 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 22:45:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-23 22:45:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-02-23 22:45:16,402 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-02-23 22:45:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-02-23 22:45:16,403 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-02-23 22:45:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:16,403 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-02-23 22:45:16,403 INFO L471 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-02-23 22:45:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-02-23 22:45:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-23 22:45:16,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:16,404 INFO L514 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-02-23 22:45:16,420 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-02-23 22:45:16,620 WARN L452 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-02-23 22:45:16,621 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-02-23 22:45:16,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:16,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948384292] [2022-02-23 22:45:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:16,630 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:16,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706143863] [2022-02-23 22:45:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:16,632 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-02-23 22:45:16,633 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-02-23 22:45:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:16,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 22:45:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:16,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:16,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:16,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948384292] [2022-02-23 22:45:16,747 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:16,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706143863] [2022-02-23 22:45:16,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706143863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:16,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:16,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 22:45:16,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253483014] [2022-02-23 22:45:16,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:16,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 22:45:16,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:16,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 22:45:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-23 22:45:16,748 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-02-23 22:45:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:16,777 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-02-23 22:45:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 22:45:16,777 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-02-23 22:45:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:16,778 INFO L225 Difference]: With dead ends: 241 [2022-02-23 22:45:16,779 INFO L226 Difference]: Without dead ends: 174 [2022-02-23 22:45:16,779 INFO L932 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-02-23 22:45:16,780 INFO L933 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-02-23 22:45:16,780 INFO L934 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-02-23 22:45:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-23 22:45:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-02-23 22:45:16,792 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-02-23 22:45:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-02-23 22:45:16,793 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-02-23 22:45:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:16,793 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-02-23 22:45:16,793 INFO L471 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-02-23 22:45:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-02-23 22:45:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-23 22:45:16,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:16,794 INFO L514 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-02-23 22:45:16,826 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-02-23 22:45:17,026 WARN L452 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-02-23 22:45:17,026 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-02-23 22:45:17,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:17,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694868532] [2022-02-23 22:45:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:17,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:17,044 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:17,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547388496] [2022-02-23 22:45:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:17,047 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-02-23 22:45:17,048 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-02-23 22:45:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:17,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 22:45:17,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-23 22:45:17,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:17,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:17,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694868532] [2022-02-23 22:45:17,146 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:17,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547388496] [2022-02-23 22:45:17,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547388496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:17,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:17,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 22:45:17,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255163212] [2022-02-23 22:45:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:17,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:17,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 22:45:17,148 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-02-23 22:45:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:17,186 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-02-23 22:45:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 22:45:17,187 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-02-23 22:45:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:17,190 INFO L225 Difference]: With dead ends: 239 [2022-02-23 22:45:17,190 INFO L226 Difference]: Without dead ends: 237 [2022-02-23 22:45:17,191 INFO L932 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-02-23 22:45:17,191 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:17,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-23 22:45:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-02-23 22:45:17,206 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-02-23 22:45:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-02-23 22:45:17,207 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-02-23 22:45:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:17,208 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-02-23 22:45:17,208 INFO L471 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-02-23 22:45:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-02-23 22:45:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-23 22:45:17,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:17,209 INFO L514 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-02-23 22:45:17,227 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-02-23 22:45:17,416 WARN L452 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-02-23 22:45:17,416 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-02-23 22:45:17,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:17,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940132600] [2022-02-23 22:45:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:17,424 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:17,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041004915] [2022-02-23 22:45:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:17,429 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-02-23 22:45:17,429 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-02-23 22:45:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-23 22:45:17,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:17,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:17,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:17,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940132600] [2022-02-23 22:45:17,698 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:17,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041004915] [2022-02-23 22:45:17,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041004915] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:17,698 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:17,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-23 22:45:17,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506818592] [2022-02-23 22:45:17,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:17,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 22:45:17,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 22:45:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-23 22:45:17,699 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-02-23 22:45:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:18,388 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-02-23 22:45:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-23 22:45:18,388 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-02-23 22:45:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:18,390 INFO L225 Difference]: With dead ends: 392 [2022-02-23 22:45:18,390 INFO L226 Difference]: Without dead ends: 390 [2022-02-23 22:45:18,390 INFO L932 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-02-23 22:45:18,391 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 170 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:18,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 370 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-23 22:45:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-23 22:45:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-02-23 22:45:18,415 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-02-23 22:45:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-02-23 22:45:18,417 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-02-23 22:45:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:18,417 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-02-23 22:45:18,417 INFO L471 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-02-23 22:45:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-02-23 22:45:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-23 22:45:18,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:18,418 INFO L514 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-02-23 22:45:18,436 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-02-23 22:45:18,629 WARN L452 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-02-23 22:45:18,629 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-02-23 22:45:18,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:18,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885236585] [2022-02-23 22:45:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:18,636 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:18,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903326101] [2022-02-23 22:45:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:18,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:18,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:18,638 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-02-23 22:45:18,639 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-02-23 22:45:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 22:45:18,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 22:45:18,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:18,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:18,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885236585] [2022-02-23 22:45:18,749 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:18,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903326101] [2022-02-23 22:45:18,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903326101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:18,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:18,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 22:45:18,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238559677] [2022-02-23 22:45:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:18,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:18,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 22:45:18,751 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-02-23 22:45:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:18,807 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-02-23 22:45:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 22:45:18,808 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-02-23 22:45:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:18,810 INFO L225 Difference]: With dead ends: 566 [2022-02-23 22:45:18,810 INFO L226 Difference]: Without dead ends: 564 [2022-02-23 22:45:18,811 INFO L932 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-02-23 22:45:18,811 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:18,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-02-23 22:45:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-02-23 22:45:18,857 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-02-23 22:45:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-02-23 22:45:18,859 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-02-23 22:45:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:18,860 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-02-23 22:45:18,860 INFO L471 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-02-23 22:45:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-02-23 22:45:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-23 22:45:18,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:18,860 INFO L514 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-02-23 22:45:18,878 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-02-23 22:45:19,075 WARN L452 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-02-23 22:45:19,076 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-02-23 22:45:19,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:19,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760567061] [2022-02-23 22:45:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:19,082 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:19,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523309597] [2022-02-23 22:45:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:19,085 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-02-23 22:45:19,086 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-02-23 22:45:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:19,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-23 22:45:19,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-23 22:45:19,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-23 22:45:19,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:19,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760567061] [2022-02-23 22:45:19,268 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:19,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523309597] [2022-02-23 22:45:19,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523309597] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:19,268 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:19,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-23 22:45:19,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21491995] [2022-02-23 22:45:19,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:19,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-23 22:45:19,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-23 22:45:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-23 22:45:19,269 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-02-23 22:45:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:19,447 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-02-23 22:45:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-23 22:45:19,447 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-02-23 22:45:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:19,451 INFO L225 Difference]: With dead ends: 1127 [2022-02-23 22:45:19,452 INFO L226 Difference]: Without dead ends: 770 [2022-02-23 22:45:19,453 INFO L932 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-02-23 22:45:19,453 INFO L933 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-02-23 22:45:19,454 INFO L934 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-02-23 22:45:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-02-23 22:45:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-02-23 22:45:19,522 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-02-23 22:45:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-02-23 22:45:19,524 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-02-23 22:45:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:19,525 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-02-23 22:45:19,525 INFO L471 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-02-23 22:45:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-02-23 22:45:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-23 22:45:19,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:19,525 INFO L514 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-02-23 22:45:19,541 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-02-23 22:45:19,735 WARN L452 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-02-23 22:45:19,735 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-02-23 22:45:19,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:19,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203832489] [2022-02-23 22:45:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:19,741 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:19,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043465142] [2022-02-23 22:45:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:19,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:19,745 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-02-23 22:45:19,745 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-02-23 22:45:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:19,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-23 22:45:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:19,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 22:45:19,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:19,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203832489] [2022-02-23 22:45:19,970 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:19,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043465142] [2022-02-23 22:45:19,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043465142] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:19,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:19,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-23 22:45:19,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354288048] [2022-02-23 22:45:19,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:19,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-23 22:45:19,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-23 22:45:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-23 22:45:19,972 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-02-23 22:45:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:20,264 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-02-23 22:45:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-23 22:45:20,264 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-02-23 22:45:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:20,269 INFO L225 Difference]: With dead ends: 1597 [2022-02-23 22:45:20,269 INFO L226 Difference]: Without dead ends: 1119 [2022-02-23 22:45:20,271 INFO L932 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-02-23 22:45:20,272 INFO L933 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-02-23 22:45:20,272 INFO L934 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-02-23 22:45:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-02-23 22:45:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-02-23 22:45:20,359 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-02-23 22:45:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-02-23 22:45:20,365 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-02-23 22:45:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:20,365 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-02-23 22:45:20,365 INFO L471 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-02-23 22:45:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-02-23 22:45:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-23 22:45:20,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:20,365 INFO L514 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-02-23 22:45:20,387 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-02-23 22:45:20,583 WARN L452 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-02-23 22:45:20,584 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-02-23 22:45:20,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:20,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708847316] [2022-02-23 22:45:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:20,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:20,591 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:20,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066037043] [2022-02-23 22:45:20,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:45:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:20,596 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-02-23 22:45:20,597 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-02-23 22:45:20,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:45:20,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:45:20,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 22:45:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-23 22:45:20,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:20,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:20,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708847316] [2022-02-23 22:45:20,714 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:20,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066037043] [2022-02-23 22:45:20,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066037043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:20,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:20,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 22:45:20,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802470569] [2022-02-23 22:45:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:20,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:20,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 22:45:20,715 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-02-23 22:45:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:20,844 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-02-23 22:45:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 22:45:20,844 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-02-23 22:45:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:20,848 INFO L225 Difference]: With dead ends: 1700 [2022-02-23 22:45:20,849 INFO L226 Difference]: Without dead ends: 1234 [2022-02-23 22:45:20,850 INFO L932 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-02-23 22:45:20,851 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:20,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 195 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-02-23 22:45:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-02-23 22:45:20,936 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-02-23 22:45:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-02-23 22:45:20,940 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-02-23 22:45:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:20,940 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-02-23 22:45:20,940 INFO L471 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-02-23 22:45:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-02-23 22:45:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-23 22:45:20,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:20,941 INFO L514 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-02-23 22:45:20,973 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-02-23 22:45:21,145 WARN L452 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-02-23 22:45:21,146 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-02-23 22:45:21,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:21,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628555957] [2022-02-23 22:45:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:21,153 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:21,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035723631] [2022-02-23 22:45:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:21,158 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-02-23 22:45:21,159 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-02-23 22:45:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:21,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-23 22:45:21,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 22:45:21,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 22:45:22,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:22,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628555957] [2022-02-23 22:45:22,273 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:22,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035723631] [2022-02-23 22:45:22,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035723631] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:22,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:22,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-02-23 22:45:22,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747039066] [2022-02-23 22:45:22,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:22,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-23 22:45:22,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-23 22:45:22,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-02-23 22:45:22,275 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-02-23 22:45:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:27,261 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-02-23 22:45:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-23 22:45:27,262 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-02-23 22:45:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:27,266 INFO L225 Difference]: With dead ends: 1412 [2022-02-23 22:45:27,266 INFO L226 Difference]: Without dead ends: 1404 [2022-02-23 22:45:27,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-02-23 22:45:27,267 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:27,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 676 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-02-23 22:45:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-02-23 22:45:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-02-23 22:45:27,424 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-02-23 22:45:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-02-23 22:45:27,428 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-02-23 22:45:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:27,428 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-02-23 22:45:27,428 INFO L471 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-02-23 22:45:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-02-23 22:45:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-23 22:45:27,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:27,429 INFO L514 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-02-23 22:45:27,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-23 22:45:27,643 WARN L452 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-02-23 22:45:27,643 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-02-23 22:45:27,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:27,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980491561] [2022-02-23 22:45:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:27,650 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:27,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676359926] [2022-02-23 22:45:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:27,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:27,651 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-02-23 22:45:27,652 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-02-23 22:45:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:27,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-23 22:45:27,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-23 22:45:27,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-23 22:45:27,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:27,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980491561] [2022-02-23 22:45:27,960 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:27,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676359926] [2022-02-23 22:45:27,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676359926] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:27,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:27,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-02-23 22:45:27,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774308661] [2022-02-23 22:45:27,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:27,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-23 22:45:27,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-23 22:45:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-02-23 22:45:27,961 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-02-23 22:45:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:28,534 INFO L93 Difference]: Finished difference Result 2565 states and 3679 transitions. [2022-02-23 22:45:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-23 22:45:28,535 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-02-23 22:45:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:28,544 INFO L225 Difference]: With dead ends: 2565 [2022-02-23 22:45:28,544 INFO L226 Difference]: Without dead ends: 2543 [2022-02-23 22:45:28,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-02-23 22:45:28,545 INFO L933 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-02-23 22:45:28,545 INFO L934 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-02-23 22:45:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-02-23 22:45:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-02-23 22:45:28,853 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-02-23 22:45:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-02-23 22:45:28,860 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-02-23 22:45:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:28,860 INFO L470 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-02-23 22:45:28,860 INFO L471 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-02-23 22:45:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-02-23 22:45:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-23 22:45:28,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:28,861 INFO L514 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-02-23 22:45:28,879 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-02-23 22:45:29,079 WARN L452 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-02-23 22:45:29,080 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-02-23 22:45:29,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:29,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095103560] [2022-02-23 22:45:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:29,085 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:29,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464963482] [2022-02-23 22:45:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:29,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:29,091 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-02-23 22:45:29,091 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-02-23 22:45:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:29,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-23 22:45:29,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-02-23 22:45:29,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-02-23 22:45:29,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:29,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095103560] [2022-02-23 22:45:29,429 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:29,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464963482] [2022-02-23 22:45:29,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464963482] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-23 22:45:29,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 22:45:29,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-02-23 22:45:29,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644531383] [2022-02-23 22:45:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:29,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:29,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-23 22:45:29,430 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-02-23 22:45:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:29,726 INFO L93 Difference]: Finished difference Result 2467 states and 3485 transitions. [2022-02-23 22:45:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 22:45:29,727 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-02-23 22:45:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:29,735 INFO L225 Difference]: With dead ends: 2467 [2022-02-23 22:45:29,735 INFO L226 Difference]: Without dead ends: 2465 [2022-02-23 22:45:29,737 INFO L932 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-02-23 22:45:29,737 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:29,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-02-23 22:45:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-02-23 22:45:30,038 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-02-23 22:45:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-02-23 22:45:30,049 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-02-23 22:45:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:30,049 INFO L470 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-02-23 22:45:30,049 INFO L471 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-02-23 22:45:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-02-23 22:45:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-23 22:45:30,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:30,053 INFO L514 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-02-23 22:45:30,075 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-02-23 22:45:30,276 WARN L452 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-02-23 22:45:30,276 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-02-23 22:45:30,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:30,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358965640] [2022-02-23 22:45:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:30,285 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:30,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028364776] [2022-02-23 22:45:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:30,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:30,286 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-02-23 22:45:30,289 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-02-23 22:45:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:30,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-23 22:45:30,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-23 22:45:30,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:45:30,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:30,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358965640] [2022-02-23 22:45:30,425 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:30,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028364776] [2022-02-23 22:45:30,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028364776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:45:30,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:45:30,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 22:45:30,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808041748] [2022-02-23 22:45:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:45:30,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 22:45:30,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 22:45:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-23 22:45:30,426 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-02-23 22:45:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:30,733 INFO L93 Difference]: Finished difference Result 4377 states and 6175 transitions. [2022-02-23 22:45:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 22:45:30,734 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-02-23 22:45:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:30,742 INFO L225 Difference]: With dead ends: 4377 [2022-02-23 22:45:30,742 INFO L226 Difference]: Without dead ends: 2578 [2022-02-23 22:45:30,745 INFO L932 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-02-23 22:45:30,745 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:30,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:45:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-02-23 22:45:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-02-23 22:45:31,041 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-02-23 22:45:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-02-23 22:45:31,046 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-02-23 22:45:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:31,046 INFO L470 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-02-23 22:45:31,046 INFO L471 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-02-23 22:45:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-02-23 22:45:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-23 22:45:31,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:31,047 INFO L514 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-02-23 22:45:31,063 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-02-23 22:45:31,259 WARN L452 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-02-23 22:45:31,259 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-02-23 22:45:31,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:31,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789400131] [2022-02-23 22:45:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:31,267 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:31,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560089165] [2022-02-23 22:45:31,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:45:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:31,271 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-02-23 22:45:31,277 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-02-23 22:45:31,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:45:31,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:45:31,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-23 22:45:31,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-23 22:45:32,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-23 22:45:33,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:33,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789400131] [2022-02-23 22:45:33,555 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:33,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560089165] [2022-02-23 22:45:33,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560089165] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:33,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:33,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-02-23 22:45:33,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407302715] [2022-02-23 22:45:33,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:33,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-23 22:45:33,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:33,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-23 22:45:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-02-23 22:45:33,557 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-02-23 22:45:42,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:45:46,381 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-02-23 22:45:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:45:49,181 INFO L93 Difference]: Finished difference Result 2869 states and 3894 transitions. [2022-02-23 22:45:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-23 22:45:49,182 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-02-23 22:45:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:45:49,190 INFO L225 Difference]: With dead ends: 2869 [2022-02-23 22:45:49,190 INFO L226 Difference]: Without dead ends: 2863 [2022-02-23 22:45:49,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-02-23 22:45:49,191 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 297 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 303 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-02-23 22:45:49,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 848 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1026 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2022-02-23 22:45:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-02-23 22:45:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-02-23 22:45:49,527 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-02-23 22:45:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-02-23 22:45:49,532 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-02-23 22:45:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:45:49,532 INFO L470 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-02-23 22:45:49,533 INFO L471 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-02-23 22:45:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-02-23 22:45:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-23 22:45:49,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:45:49,535 INFO L514 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-02-23 22:45:49,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-02-23 22:45:49,751 WARN L452 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-02-23 22:45:49,751 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:45:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:45:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-02-23 22:45:49,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:45:49,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076048880] [2022-02-23 22:45:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:45:49,757 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:45:49,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369642323] [2022-02-23 22:45:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:45:49,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:45:49,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:45:49,758 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-02-23 22:45:49,759 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-02-23 22:45:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:45:49,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-23 22:45:49,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:45:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-02-23 22:45:51,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:45:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-02-23 22:45:56,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:45:56,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076048880] [2022-02-23 22:45:56,467 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:45:56,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369642323] [2022-02-23 22:45:56,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369642323] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:45:56,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:45:56,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-02-23 22:45:56,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136624721] [2022-02-23 22:45:56,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:45:56,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-23 22:45:56,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:45:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-23 22:45:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-02-23 22:45:56,468 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-02-23 22:46:06,667 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-02-23 22:46:12,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:46:26,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:46:44,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:46:45,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:46:53,266 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-02-23 22:47:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:04,144 INFO L93 Difference]: Finished difference Result 3394 states and 4591 transitions. [2022-02-23 22:47:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-23 22:47:04,147 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-02-23 22:47:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:04,155 INFO L225 Difference]: With dead ends: 3394 [2022-02-23 22:47:04,155 INFO L226 Difference]: Without dead ends: 3363 [2022-02-23 22:47:04,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=1914, Invalid=9428, Unknown=0, NotChecked=0, Total=11342 [2022-02-23 22:47:04,158 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 405 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 519 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:04,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 1241 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1495 Invalid, 2 Unknown, 0 Unchecked, 20.7s Time] [2022-02-23 22:47:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-02-23 22:47:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3022. [2022-02-23 22:47:04,691 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-02-23 22:47:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4123 transitions. [2022-02-23 22:47:04,697 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4123 transitions. Word has length 88 [2022-02-23 22:47:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:04,697 INFO L470 AbstractCegarLoop]: Abstraction has 3022 states and 4123 transitions. [2022-02-23 22:47:04,697 INFO L471 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-02-23 22:47:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4123 transitions. [2022-02-23 22:47:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-23 22:47:04,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:04,698 INFO L514 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-02-23 22:47:04,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-02-23 22:47:04,915 WARN L452 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-02-23 22:47:04,915 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-02-23 22:47:04,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:04,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465470501] [2022-02-23 22:47:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:04,925 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:04,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751896967] [2022-02-23 22:47:04,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 22:47:04,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:04,926 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-02-23 22:47:04,927 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-02-23 22:47:04,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-23 22:47:04,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:47:04,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-23 22:47:04,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-02-23 22:47:05,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-02-23 22:47:05,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:05,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465470501] [2022-02-23 22:47:05,770 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:05,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751896967] [2022-02-23 22:47:05,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751896967] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:05,770 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:05,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-02-23 22:47:05,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676291124] [2022-02-23 22:47:05,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:05,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-23 22:47:05,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-23 22:47:05,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-23 22:47:05,771 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-02-23 22:47:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:10,189 INFO L93 Difference]: Finished difference Result 3244 states and 4417 transitions. [2022-02-23 22:47:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-23 22:47:10,190 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-02-23 22:47:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:10,199 INFO L225 Difference]: With dead ends: 3244 [2022-02-23 22:47:10,199 INFO L226 Difference]: Without dead ends: 3232 [2022-02-23 22:47:10,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-02-23 22:47:10,200 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 107 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:10,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 677 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-02-23 22:47:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-02-23 22:47:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2949. [2022-02-23 22:47:10,768 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-02-23 22:47:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4028 transitions. [2022-02-23 22:47:10,779 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4028 transitions. Word has length 97 [2022-02-23 22:47:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:10,779 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 4028 transitions. [2022-02-23 22:47:10,779 INFO L471 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-02-23 22:47:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4028 transitions. [2022-02-23 22:47:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-23 22:47:10,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:10,780 INFO L514 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-02-23 22:47:10,797 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-02-23 22:47:10,995 WARN L452 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-02-23 22:47:10,995 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1037830812, now seen corresponding path program 1 times [2022-02-23 22:47:10,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:10,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952789517] [2022-02-23 22:47:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:11,001 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:11,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126329584] [2022-02-23 22:47:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:11,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:11,003 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-02-23 22:47:11,005 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-02-23 22:47:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:47:11,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-23 22:47:11,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-23 22:47:11,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-23 22:47:11,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:11,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952789517] [2022-02-23 22:47:11,461 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:11,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126329584] [2022-02-23 22:47:11,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126329584] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:11,461 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:11,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-02-23 22:47:11,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022569177] [2022-02-23 22:47:11,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:11,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-23 22:47:11,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:11,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-23 22:47:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-02-23 22:47:11,462 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-02-23 22:47:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:13,121 INFO L93 Difference]: Finished difference Result 6529 states and 9288 transitions. [2022-02-23 22:47:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-23 22:47:13,121 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-02-23 22:47:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:13,138 INFO L225 Difference]: With dead ends: 6529 [2022-02-23 22:47:13,138 INFO L226 Difference]: Without dead ends: 5495 [2022-02-23 22:47:13,141 INFO L932 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-02-23 22:47:13,142 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 518 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:13,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 747 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-23 22:47:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2022-02-23 22:47:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5193. [2022-02-23 22:47:14,290 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-02-23 22:47:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7184 transitions. [2022-02-23 22:47:14,299 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7184 transitions. Word has length 98 [2022-02-23 22:47:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:14,299 INFO L470 AbstractCegarLoop]: Abstraction has 5193 states and 7184 transitions. [2022-02-23 22:47:14,300 INFO L471 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-02-23 22:47:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7184 transitions. [2022-02-23 22:47:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-23 22:47:14,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:14,301 INFO L514 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-02-23 22:47:14,317 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-02-23 22:47:14,508 WARN L452 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-02-23 22:47:14,509 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2067527905, now seen corresponding path program 2 times [2022-02-23 22:47:14,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:14,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176076686] [2022-02-23 22:47:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:14,519 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:14,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307183814] [2022-02-23 22:47:14,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:47:14,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:14,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:14,520 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-02-23 22:47:14,521 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-02-23 22:47:14,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:47:14,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:47:14,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-02-23 22:47:14,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-02-23 22:47:15,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-02-23 22:47:17,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:17,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176076686] [2022-02-23 22:47:17,086 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:17,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307183814] [2022-02-23 22:47:17,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307183814] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:17,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:17,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-02-23 22:47:17,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621080426] [2022-02-23 22:47:17,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:17,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-23 22:47:17,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-23 22:47:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-02-23 22:47:17,087 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-02-23 22:47:24,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:47:26,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 22:47:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:28,088 INFO L93 Difference]: Finished difference Result 6197 states and 8558 transitions. [2022-02-23 22:47:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-23 22:47:28,089 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-02-23 22:47:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:28,102 INFO L225 Difference]: With dead ends: 6197 [2022-02-23 22:47:28,103 INFO L226 Difference]: Without dead ends: 6191 [2022-02-23 22:47:28,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-02-23 22:47:28,105 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 222 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 404 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:28,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 792 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1177 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-02-23 22:47:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2022-02-23 22:47:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5573. [2022-02-23 22:47:29,376 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-02-23 22:47:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7780 transitions. [2022-02-23 22:47:29,385 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7780 transitions. Word has length 108 [2022-02-23 22:47:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:29,385 INFO L470 AbstractCegarLoop]: Abstraction has 5573 states and 7780 transitions. [2022-02-23 22:47:29,385 INFO L471 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-02-23 22:47:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7780 transitions. [2022-02-23 22:47:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-23 22:47:29,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:29,387 INFO L514 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-02-23 22:47:29,405 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-02-23 22:47:29,593 WARN L452 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-02-23 22:47:29,594 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -55503749, now seen corresponding path program 1 times [2022-02-23 22:47:29,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:29,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135009279] [2022-02-23 22:47:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:29,599 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:29,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686063889] [2022-02-23 22:47:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:29,602 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-02-23 22:47:29,602 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-02-23 22:47:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:47:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-23 22:47:29,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-23 22:47:29,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-23 22:47:30,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:30,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135009279] [2022-02-23 22:47:30,099 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:30,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686063889] [2022-02-23 22:47:30,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686063889] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:30,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:30,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-23 22:47:30,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99078951] [2022-02-23 22:47:30,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:30,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-23 22:47:30,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-23 22:47:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-02-23 22:47:30,100 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-02-23 22:47:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:32,212 INFO L93 Difference]: Finished difference Result 9286 states and 13116 transitions. [2022-02-23 22:47:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-23 22:47:32,213 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-02-23 22:47:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:32,225 INFO L225 Difference]: With dead ends: 9286 [2022-02-23 22:47:32,225 INFO L226 Difference]: Without dead ends: 6132 [2022-02-23 22:47:32,231 INFO L932 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-02-23 22:47:32,231 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 615 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:32,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 591 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-23 22:47:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2022-02-23 22:47:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6001. [2022-02-23 22:47:33,690 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-02-23 22:47:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 8118 transitions. [2022-02-23 22:47:33,702 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 8118 transitions. Word has length 105 [2022-02-23 22:47:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:33,703 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 8118 transitions. [2022-02-23 22:47:33,704 INFO L471 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-02-23 22:47:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 8118 transitions. [2022-02-23 22:47:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-23 22:47:33,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:33,706 INFO L514 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-02-23 22:47:33,723 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-02-23 22:47:33,923 WARN L452 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-02-23 22:47:33,923 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1765875055, now seen corresponding path program 2 times [2022-02-23 22:47:33,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:33,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091671301] [2022-02-23 22:47:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:33,929 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:33,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456647400] [2022-02-23 22:47:33,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:47:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:33,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:33,933 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-02-23 22:47:33,934 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-02-23 22:47:33,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:47:33,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:47:33,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-23 22:47:33,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:34,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-02-23 22:47:34,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-02-23 22:47:34,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:34,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091671301] [2022-02-23 22:47:34,677 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:34,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456647400] [2022-02-23 22:47:34,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456647400] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:34,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:34,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-02-23 22:47:34,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181738377] [2022-02-23 22:47:34,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:34,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-23 22:47:34,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-23 22:47:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-02-23 22:47:34,679 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-02-23 22:47:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:38,239 INFO L93 Difference]: Finished difference Result 11127 states and 15741 transitions. [2022-02-23 22:47:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-23 22:47:38,239 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-02-23 22:47:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:38,259 INFO L225 Difference]: With dead ends: 11127 [2022-02-23 22:47:38,260 INFO L226 Difference]: Without dead ends: 11122 [2022-02-23 22:47:38,263 INFO L932 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-02-23 22:47:38,263 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 934 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:38,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 899 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-23 22:47:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11122 states. [2022-02-23 22:47:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11122 to 10698. [2022-02-23 22:47:40,967 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-02-23 22:47:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10698 states to 10698 states and 14991 transitions. [2022-02-23 22:47:40,987 INFO L78 Accepts]: Start accepts. Automaton has 10698 states and 14991 transitions. Word has length 132 [2022-02-23 22:47:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:40,987 INFO L470 AbstractCegarLoop]: Abstraction has 10698 states and 14991 transitions. [2022-02-23 22:47:40,987 INFO L471 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-02-23 22:47:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10698 states and 14991 transitions. [2022-02-23 22:47:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-02-23 22:47:40,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:40,995 INFO L514 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-02-23 22:47:41,012 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-02-23 22:47:41,213 WARN L452 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-02-23 22:47:41,213 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1872087437, now seen corresponding path program 1 times [2022-02-23 22:47:41,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:41,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915502369] [2022-02-23 22:47:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:41,220 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:41,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159668131] [2022-02-23 22:47:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:41,221 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-02-23 22:47:41,222 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-02-23 22:47:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:47:41,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-23 22:47:41,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 897 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-02-23 22:47:41,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 257 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-02-23 22:47:42,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:42,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915502369] [2022-02-23 22:47:42,378 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:42,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159668131] [2022-02-23 22:47:42,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159668131] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:42,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:42,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-02-23 22:47:42,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990169649] [2022-02-23 22:47:42,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:42,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-23 22:47:42,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:42,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-23 22:47:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-02-23 22:47:42,381 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-02-23 22:47:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:47,761 INFO L93 Difference]: Finished difference Result 18017 states and 25879 transitions. [2022-02-23 22:47:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-23 22:47:47,762 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-02-23 22:47:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:47,795 INFO L225 Difference]: With dead ends: 18017 [2022-02-23 22:47:47,796 INFO L226 Difference]: Without dead ends: 15306 [2022-02-23 22:47:47,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2609, Invalid=4531, Unknown=0, NotChecked=0, Total=7140 [2022-02-23 22:47:47,805 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 1673 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:47,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1673 Valid, 1347 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-23 22:47:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15306 states. [2022-02-23 22:47:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15306 to 14953. [2022-02-23 22:47:51,537 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-02-23 22:47:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14953 states to 14953 states and 20975 transitions. [2022-02-23 22:47:51,567 INFO L78 Accepts]: Start accepts. Automaton has 14953 states and 20975 transitions. Word has length 196 [2022-02-23 22:47:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:47:51,567 INFO L470 AbstractCegarLoop]: Abstraction has 14953 states and 20975 transitions. [2022-02-23 22:47:51,568 INFO L471 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-02-23 22:47:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 14953 states and 20975 transitions. [2022-02-23 22:47:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-02-23 22:47:51,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:47:51,577 INFO L514 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-02-23 22:47:51,603 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-02-23 22:47:51,803 WARN L452 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-02-23 22:47:51,803 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:47:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:47:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2139737637, now seen corresponding path program 2 times [2022-02-23 22:47:51,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:47:51,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360227360] [2022-02-23 22:47:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:47:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:47:51,813 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:47:51,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203894844] [2022-02-23 22:47:51,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:47:51,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:47:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:47:51,814 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-02-23 22:47:51,815 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-02-23 22:47:51,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:47:51,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:47:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-23 22:47:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:47:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 950 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-02-23 22:47:52,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:47:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 310 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-02-23 22:47:53,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:47:53,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360227360] [2022-02-23 22:47:53,077 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:47:53,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203894844] [2022-02-23 22:47:53,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203894844] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:47:53,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:47:53,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-02-23 22:47:53,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127537385] [2022-02-23 22:47:53,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:47:53,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-23 22:47:53,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:47:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-23 22:47:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-02-23 22:47:53,085 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-02-23 22:47:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:47:58,852 INFO L93 Difference]: Finished difference Result 22942 states and 32447 transitions. [2022-02-23 22:47:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-02-23 22:47:58,853 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-02-23 22:47:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:47:58,888 INFO L225 Difference]: With dead ends: 22942 [2022-02-23 22:47:58,888 INFO L226 Difference]: Without dead ends: 15900 [2022-02-23 22:47:58,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3132, Invalid=5424, Unknown=0, NotChecked=0, Total=8556 [2022-02-23 22:47:58,905 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 1689 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-23 22:47:58,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1689 Valid, 1379 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-23 22:47:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15900 states. [2022-02-23 22:48:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15900 to 15657. [2022-02-23 22:48:03,148 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-02-23 22:48:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 21417 transitions. [2022-02-23 22:48:03,181 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 21417 transitions. Word has length 207 [2022-02-23 22:48:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:48:03,181 INFO L470 AbstractCegarLoop]: Abstraction has 15657 states and 21417 transitions. [2022-02-23 22:48:03,181 INFO L471 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-02-23 22:48:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 21417 transitions. [2022-02-23 22:48:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-02-23 22:48:03,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:48:03,194 INFO L514 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-02-23 22:48:03,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-23 22:48:03,403 WARN L452 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-02-23 22:48:03,403 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:48:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:48:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -777184055, now seen corresponding path program 3 times [2022-02-23 22:48:03,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:48:03,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746822482] [2022-02-23 22:48:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:48:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:48:03,412 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:48:03,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55142968] [2022-02-23 22:48:03,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 22:48:03,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:48:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:48:03,413 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-02-23 22:48:03,414 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-02-23 22:48:41,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-23 22:48:41,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:48:41,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-23 22:48:41,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:48:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 1955 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-02-23 22:48:42,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:48:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 611 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2022-02-23 22:48:43,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:48:43,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746822482] [2022-02-23 22:48:43,497 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:48:43,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55142968] [2022-02-23 22:48:43,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55142968] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:48:43,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:48:43,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-02-23 22:48:43,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475469916] [2022-02-23 22:48:43,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:48:43,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-02-23 22:48:43,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:48:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-02-23 22:48:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2022-02-23 22:48:43,500 INFO L87 Difference]: Start difference. First operand 15657 states and 21417 transitions. Second operand has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 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-02-23 22:48:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:48:53,603 INFO L93 Difference]: Finished difference Result 28246 states and 40383 transitions. [2022-02-23 22:48:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-02-23 22:48:53,603 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 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-02-23 22:48:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:48:53,671 INFO L225 Difference]: With dead ends: 28246 [2022-02-23 22:48:53,671 INFO L226 Difference]: Without dead ends: 28241 [2022-02-23 22:48:53,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5711, Invalid=9789, Unknown=0, NotChecked=0, Total=15500 [2022-02-23 22:48:53,681 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 2508 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 3598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-23 22:48:53,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2508 Valid, 1564 Invalid, 3598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-23 22:48:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28241 states. [2022-02-23 22:49:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28241 to 26895. [2022-02-23 22:49:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26895 states, 18081 states have (on average 1.2632044687793818) internal successors, (22840), 18208 states have internal predecessors, (22840), 7539 states have call successors, (7539), 1276 states have call predecessors, (7539), 1274 states have return successors, (7537), 7410 states have call predecessors, (7537), 7537 states have call successors, (7537) [2022-02-23 22:49:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26895 states to 26895 states and 37916 transitions. [2022-02-23 22:49:00,607 INFO L78 Accepts]: Start accepts. Automaton has 26895 states and 37916 transitions. Word has length 268 [2022-02-23 22:49:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:49:00,607 INFO L470 AbstractCegarLoop]: Abstraction has 26895 states and 37916 transitions. [2022-02-23 22:49:00,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 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-02-23 22:49:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26895 states and 37916 transitions. [2022-02-23 22:49:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-02-23 22:49:00,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:49:00,633 INFO L514 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-02-23 22:49:00,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-02-23 22:49:00,842 WARN L452 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-02-23 22:49:00,842 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:49:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:49:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2114344233, now seen corresponding path program 2 times [2022-02-23 22:49:00,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:49:00,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110619596] [2022-02-23 22:49:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:49:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:49:00,852 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:49:00,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978124183] [2022-02-23 22:49:00,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:49:00,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:49:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:49:00,853 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-02-23 22:49:00,854 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-02-23 22:49:00,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:49:00,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:49:00,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 91 conjunts are in the unsatisfiable core [2022-02-23 22:49:00,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:49:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 4165 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-02-23 22:49:02,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:49:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 1285 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2022-02-23 22:49:04,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:49:04,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110619596] [2022-02-23 22:49:04,449 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:49:04,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978124183] [2022-02-23 22:49:04,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978124183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:49:04,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:49:04,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2022-02-23 22:49:04,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603874229] [2022-02-23 22:49:04,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:49:04,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-02-23 22:49:04,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:49:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-02-23 22:49:04,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4010, Invalid=4362, Unknown=0, NotChecked=0, Total=8372 [2022-02-23 22:49:04,453 INFO L87 Difference]: Start difference. First operand 26895 states and 37916 transitions. Second operand has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 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-02-23 22:49:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:49:20,310 INFO L93 Difference]: Finished difference Result 42842 states and 61648 transitions. [2022-02-23 22:49:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-02-23 22:49:20,311 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 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-02-23 22:49:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:49:20,397 INFO L225 Difference]: With dead ends: 42842 [2022-02-23 22:49:20,397 INFO L226 Difference]: Without dead ends: 35208 [2022-02-23 22:49:20,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11533, Invalid=19619, Unknown=0, NotChecked=0, Total=31152 [2022-02-23 22:49:20,421 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 3861 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 2622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3861 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 5435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2622 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-23 22:49:20,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3861 Valid, 2705 Invalid, 5435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2622 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-23 22:49:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35208 states. [2022-02-23 22:49:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35208 to 34673. [2022-02-23 22:49:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34673 states, 22414 states have (on average 1.2488177032212011) internal successors, (27991), 22537 states have internal predecessors, (27991), 10363 states have call successors, (10363), 1897 states have call predecessors, (10363), 1895 states have return successors, (10361), 10238 states have call predecessors, (10361), 10361 states have call successors, (10361) [2022-02-23 22:49:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34673 states to 34673 states and 48715 transitions. [2022-02-23 22:49:29,424 INFO L78 Accepts]: Start accepts. Automaton has 34673 states and 48715 transitions. Word has length 377 [2022-02-23 22:49:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:49:29,424 INFO L470 AbstractCegarLoop]: Abstraction has 34673 states and 48715 transitions. [2022-02-23 22:49:29,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 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-02-23 22:49:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34673 states and 48715 transitions. [2022-02-23 22:49:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-02-23 22:49:29,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:49:29,445 INFO L514 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-02-23 22:49:29,461 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-02-23 22:49:29,647 WARN L452 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-02-23 22:49:29,647 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:49:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:49:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2036089593, now seen corresponding path program 3 times [2022-02-23 22:49:29,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:49:29,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785159004] [2022-02-23 22:49:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:49:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:49:29,657 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:49:29,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032190389] [2022-02-23 22:49:29,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 22:49:29,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:49:29,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:49:29,658 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-02-23 22:49:29,660 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-02-23 22:49:29,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-23 22:49:29,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:49:29,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-23 22:49:29,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:49:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5477 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-02-23 22:49:30,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 22:49:30,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:49:30,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785159004] [2022-02-23 22:49:30,116 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:49:30,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032190389] [2022-02-23 22:49:30,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032190389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 22:49:30,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 22:49:30,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 22:49:30,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250162207] [2022-02-23 22:49:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 22:49:30,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 22:49:30,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:49:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 22:49:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-23 22:49:30,117 INFO L87 Difference]: Start difference. First operand 34673 states and 48715 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-02-23 22:49:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:49:41,346 INFO L93 Difference]: Finished difference Result 52937 states and 74201 transitions. [2022-02-23 22:49:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 22:49:41,347 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-02-23 22:49:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:49:41,433 INFO L225 Difference]: With dead ends: 52937 [2022-02-23 22:49:41,433 INFO L226 Difference]: Without dead ends: 45220 [2022-02-23 22:49:41,457 INFO L932 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-02-23 22:49:41,457 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 22:49:41,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 247 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 22:49:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45220 states. [2022-02-23 22:49:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45220 to 39818. [2022-02-23 22:49:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39818 states, 24787 states have (on average 1.2477508371323678) internal successors, (30928), 24907 states have internal predecessors, (30928), 12577 states have call successors, (12577), 2455 states have call predecessors, (12577), 2453 states have return successors, (12575), 12455 states have call predecessors, (12575), 12575 states have call successors, (12575) [2022-02-23 22:49:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39818 states to 39818 states and 56080 transitions. [2022-02-23 22:49:51,666 INFO L78 Accepts]: Start accepts. Automaton has 39818 states and 56080 transitions. Word has length 411 [2022-02-23 22:49:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:49:51,667 INFO L470 AbstractCegarLoop]: Abstraction has 39818 states and 56080 transitions. [2022-02-23 22:49:51,667 INFO L471 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-02-23 22:49:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 39818 states and 56080 transitions. [2022-02-23 22:49:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2022-02-23 22:49:51,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:49:51,689 INFO L514 BasicCegarLoop]: trace histogram [45, 44, 44, 31, 31, 19, 19, 19, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:49:51,704 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-02-23 22:49:51,889 WARN L452 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-02-23 22:49:51,889 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:49:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:49:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -775482707, now seen corresponding path program 1 times [2022-02-23 22:49:51,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:49:51,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926195153] [2022-02-23 22:49:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:49:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:49:51,900 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:49:51,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799468059] [2022-02-23 22:49:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:49:51,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:49:51,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:49:51,901 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-02-23 22:49:51,902 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-02-23 22:49:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 22:49:52,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-23 22:49:52,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:49:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 4994 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-02-23 22:49:53,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:49:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 1474 refuted. 0 times theorem prover too weak. 3942 trivial. 0 not checked. [2022-02-23 22:49:55,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:49:55,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926195153] [2022-02-23 22:49:55,765 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:49:55,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799468059] [2022-02-23 22:49:55,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799468059] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:49:55,765 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:49:55,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-02-23 22:49:55,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210331742] [2022-02-23 22:49:55,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:49:55,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-02-23 22:49:55,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:49:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-02-23 22:49:55,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-02-23 22:49:55,768 INFO L87 Difference]: Start difference. First operand 39818 states and 56080 transitions. Second operand has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-02-23 22:50:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:50:12,739 INFO L93 Difference]: Finished difference Result 43180 states and 60942 transitions. [2022-02-23 22:50:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-02-23 22:50:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) Word has length 452 [2022-02-23 22:50:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:50:12,806 INFO L225 Difference]: With dead ends: 43180 [2022-02-23 22:50:12,806 INFO L226 Difference]: Without dead ends: 35564 [2022-02-23 22:50:12,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6259 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=13164, Invalid=22368, Unknown=0, NotChecked=0, Total=35532 [2022-02-23 22:50:12,825 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 4561 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 3469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 5823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3469 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-23 22:50:12,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4561 Valid, 2644 Invalid, 5823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3469 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-23 22:50:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35564 states. [2022-02-23 22:50:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35564 to 35191. [2022-02-23 22:50:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35191 states, 21996 states have (on average 1.182942353155119) internal successors, (26020), 22083 states have internal predecessors, (26020), 11147 states have call successors, (11147), 2049 states have call predecessors, (11147), 2047 states have return successors, (11145), 11058 states have call predecessors, (11145), 11145 states have call successors, (11145) [2022-02-23 22:50:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35191 states to 35191 states and 48312 transitions. [2022-02-23 22:50:22,002 INFO L78 Accepts]: Start accepts. Automaton has 35191 states and 48312 transitions. Word has length 452 [2022-02-23 22:50:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:50:22,002 INFO L470 AbstractCegarLoop]: Abstraction has 35191 states and 48312 transitions. [2022-02-23 22:50:22,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-02-23 22:50:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35191 states and 48312 transitions. [2022-02-23 22:50:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2022-02-23 22:50:22,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:50:22,027 INFO L514 BasicCegarLoop]: trace histogram [61, 60, 60, 31, 31, 17, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:50:22,044 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-02-23 22:50:22,227 WARN L452 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-02-23 22:50:22,227 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:50:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:50:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -452335303, now seen corresponding path program 4 times [2022-02-23 22:50:22,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:50:22,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927143176] [2022-02-23 22:50:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:50:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:50:22,238 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:50:22,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836221950] [2022-02-23 22:50:22,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 22:50:22,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:50:22,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:50:22,239 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-02-23 22:50:22,240 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-02-23 22:50:28,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 22:50:28,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:50:28,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 129 conjunts are in the unsatisfiable core [2022-02-23 22:50:28,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:50:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 9467 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-02-23 22:50:29,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:50:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 2747 refuted. 0 times theorem prover too weak. 7084 trivial. 0 not checked. [2022-02-23 22:50:32,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:50:32,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927143176] [2022-02-23 22:50:32,469 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:50:32,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836221950] [2022-02-23 22:50:32,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836221950] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:50:32,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:50:32,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 104 [2022-02-23 22:50:32,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911526116] [2022-02-23 22:50:32,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:50:32,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-02-23 22:50:32,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:50:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-02-23 22:50:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-02-23 22:50:32,472 INFO L87 Difference]: Start difference. First operand 35191 states and 48312 transitions. Second operand has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-02-23 22:50:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:50:51,363 INFO L93 Difference]: Finished difference Result 40003 states and 55420 transitions. [2022-02-23 22:50:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-23 22:50:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) Word has length 540 [2022-02-23 22:50:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:50:51,441 INFO L225 Difference]: With dead ends: 40003 [2022-02-23 22:50:51,441 INFO L226 Difference]: Without dead ends: 39978 [2022-02-23 22:50:51,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14920, Invalid=25280, Unknown=0, NotChecked=0, Total=40200 [2022-02-23 22:50:51,455 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 4202 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 3297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 6042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3297 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-23 22:50:51,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4202 Valid, 2301 Invalid, 6042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3297 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-23 22:50:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39978 states. [2022-02-23 22:51:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39978 to 39293. [2022-02-23 22:51:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39293 states, 24853 states have (on average 1.191083571399831) internal successors, (29602), 25001 states have internal predecessors, (29602), 12233 states have call successors, (12233), 2208 states have call predecessors, (12233), 2206 states have return successors, (12231), 12083 states have call predecessors, (12231), 12231 states have call successors, (12231) [2022-02-23 22:51:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39293 states to 39293 states and 54066 transitions. [2022-02-23 22:51:01,772 INFO L78 Accepts]: Start accepts. Automaton has 39293 states and 54066 transitions. Word has length 540 [2022-02-23 22:51:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:51:01,773 INFO L470 AbstractCegarLoop]: Abstraction has 39293 states and 54066 transitions. [2022-02-23 22:51:01,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-02-23 22:51:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 39293 states and 54066 transitions. [2022-02-23 22:51:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2022-02-23 22:51:01,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:51:01,815 INFO L514 BasicCegarLoop]: trace histogram [89, 88, 88, 44, 43, 24, 24, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:51:01,823 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-02-23 22:51:02,023 WARN L452 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-02-23 22:51:02,024 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:51:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:51:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1290306337, now seen corresponding path program 2 times [2022-02-23 22:51:02,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:51:02,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638622791] [2022-02-23 22:51:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:51:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:51:02,037 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:51:02,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92743772] [2022-02-23 22:51:02,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:51:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:51:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:51:02,038 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 22:51:02,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-02-23 22:51:02,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:51:02,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:51:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 181 conjunts are in the unsatisfiable core [2022-02-23 22:51:02,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:51:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 20396 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-02-23 22:51:05,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:51:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 5612 refuted. 0 times theorem prover too weak. 15316 trivial. 0 not checked. [2022-02-23 22:51:07,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:51:07,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638622791] [2022-02-23 22:51:07,392 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:51:07,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92743772] [2022-02-23 22:51:07,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92743772] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:51:07,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:51:07,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 104 [2022-02-23 22:51:07,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334946109] [2022-02-23 22:51:07,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:51:07,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-02-23 22:51:07,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:51:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-02-23 22:51:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-02-23 22:51:07,397 INFO L87 Difference]: Start difference. First operand 39293 states and 54066 transitions. Second operand has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-02-23 22:51:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:51:25,258 INFO L93 Difference]: Finished difference Result 41559 states and 57295 transitions. [2022-02-23 22:51:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-23 22:51:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) Word has length 774 [2022-02-23 22:51:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:51:25,326 INFO L225 Difference]: With dead ends: 41559 [2022-02-23 22:51:25,326 INFO L226 Difference]: Without dead ends: 38002 [2022-02-23 22:51:25,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1644 GetRequests, 1444 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6047 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=14944, Invalid=25256, Unknown=0, NotChecked=0, Total=40200 [2022-02-23 22:51:25,343 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 3592 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 2789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3592 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 5394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2789 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-23 22:51:25,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3592 Valid, 2669 Invalid, 5394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2789 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-23 22:51:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2022-02-23 22:51:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 37874. [2022-02-23 22:51:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37874 states, 23599 states have (on average 1.177295648120683) internal successors, (27783), 23695 states have internal predecessors, (27783), 12049 states have call successors, (12049), 2227 states have call predecessors, (12049), 2225 states have return successors, (12047), 11951 states have call predecessors, (12047), 12047 states have call successors, (12047) [2022-02-23 22:51:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37874 states to 37874 states and 51879 transitions. [2022-02-23 22:51:35,620 INFO L78 Accepts]: Start accepts. Automaton has 37874 states and 51879 transitions. Word has length 774 [2022-02-23 22:51:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:51:35,620 INFO L470 AbstractCegarLoop]: Abstraction has 37874 states and 51879 transitions. [2022-02-23 22:51:35,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-02-23 22:51:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37874 states and 51879 transitions. [2022-02-23 22:51:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2022-02-23 22:51:35,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:51:35,665 INFO L514 BasicCegarLoop]: trace histogram [93, 92, 92, 50, 50, 26, 26, 26, 25, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:51:35,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-02-23 22:51:35,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-02-23 22:51:35,884 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:51:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:51:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2079114935, now seen corresponding path program 2 times [2022-02-23 22:51:35,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:51:35,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11646794] [2022-02-23 22:51:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:51:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:51:35,898 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:51:35,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002974218] [2022-02-23 22:51:35,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 22:51:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:51:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:51:35,899 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 22:51:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-23 22:51:36,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 22:51:36,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 22:51:36,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 2164 conjuncts, 193 conjunts are in the unsatisfiable core [2022-02-23 22:51:36,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 22:51:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 22586 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-02-23 22:51:39,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 22:51:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 6394 refuted. 0 times theorem prover too weak. 16762 trivial. 0 not checked. [2022-02-23 22:51:41,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 22:51:41,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11646794] [2022-02-23 22:51:41,176 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 22:51:41,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002974218] [2022-02-23 22:51:41,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002974218] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 22:51:41,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 22:51:41,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104 [2022-02-23 22:51:41,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474530691] [2022-02-23 22:51:41,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 22:51:41,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-02-23 22:51:41,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 22:51:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-02-23 22:51:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-02-23 22:51:41,180 INFO L87 Difference]: Start difference. First operand 37874 states and 51879 transitions. Second operand has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-02-23 22:51:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 22:51:59,065 INFO L93 Difference]: Finished difference Result 38186 states and 52313 transitions. [2022-02-23 22:51:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-02-23 22:51:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) Word has length 830 [2022-02-23 22:51:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 22:51:59,146 INFO L225 Difference]: With dead ends: 38186 [2022-02-23 22:51:59,147 INFO L226 Difference]: Without dead ends: 37412 [2022-02-23 22:51:59,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1556 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5988 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=14949, Invalid=25251, Unknown=0, NotChecked=0, Total=40200 [2022-02-23 22:51:59,161 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 4657 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 4120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4657 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 6718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4120 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-23 22:51:59,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4657 Valid, 2239 Invalid, 6718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4120 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-23 22:51:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37412 states. [2022-02-23 22:52:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37412 to 37412. [2022-02-23 22:52:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37412 states, 23323 states have (on average 1.1697894781974874) internal successors, (27283), 23416 states have internal predecessors, (27283), 11903 states have call successors, (11903), 2187 states have call predecessors, (11903), 2185 states have return successors, (11901), 11808 states have call predecessors, (11901), 11901 states have call successors, (11901) [2022-02-23 22:52:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37412 states to 37412 states and 51087 transitions. [2022-02-23 22:52:09,213 INFO L78 Accepts]: Start accepts. Automaton has 37412 states and 51087 transitions. Word has length 830 [2022-02-23 22:52:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 22:52:09,214 INFO L470 AbstractCegarLoop]: Abstraction has 37412 states and 51087 transitions. [2022-02-23 22:52:09,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-02-23 22:52:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 37412 states and 51087 transitions. [2022-02-23 22:52:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2022-02-23 22:52:09,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 22:52:09,256 INFO L514 BasicCegarLoop]: trace histogram [97, 96, 96, 51, 50, 27, 26, 26, 26, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:52:09,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-23 22:52:09,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-02-23 22:52:09,459 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 22:52:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 22:52:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1039841869, now seen corresponding path program 1 times [2022-02-23 22:52:09,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 22:52:09,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908444309] [2022-02-23 22:52:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:52:09,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 22:52:09,473 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 22:52:09,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622247900] [2022-02-23 22:52:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 22:52:09,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:52:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 22:52:09,475 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 22:52:09,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-02-23 22:52:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 22:52:16,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-23 22:52:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 22:52:32,068 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-23 22:52:32,068 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-23 22:52:32,069 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-23 22:52:32,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-02-23 22:52:32,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 22:52:32,272 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 22:52:32,275 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-23 22:52:32,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 10:52:32 BasicIcfg [2022-02-23 22:52:32,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-23 22:52:32,440 INFO L158 Benchmark]: Toolchain (without parser) took 440939.95ms. Allocated memory was 177.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 126.6MB in the beginning and 1.0GB in the end (delta: -910.8MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-02-23 22:52:32,440 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 22:52:32,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.65ms. Allocated memory is still 177.2MB. Free memory was 126.4MB in the beginning and 152.5MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-23 22:52:32,442 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 177.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 22:52:32,442 INFO L158 Benchmark]: RCFGBuilder took 280.46ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 139.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 22:52:32,442 INFO L158 Benchmark]: IcfgTransformer took 28.30ms. Allocated memory is still 177.2MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-23 22:52:32,443 INFO L158 Benchmark]: TraceAbstraction took 440435.28ms. Allocated memory was 177.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 137.4MB in the beginning and 1.0GB in the end (delta: -899.9MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-02-23 22:52:32,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.65ms. Allocated memory is still 177.2MB. Free memory was 126.4MB in the beginning and 152.5MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 177.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.46ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 139.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 28.30ms. Allocated memory is still 177.2MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 440435.28ms. Allocated memory was 177.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 137.4MB in the beginning and 1.0GB in the end (delta: -899.9MB). Peak memory consumption was 1.9GB. 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)=104, 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=121393, y=196418] [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=121393, y=196418] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=121393, b=196418, counter=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [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=196418, b=121393, c=121393, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=121393, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [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=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [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=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [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=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [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=121393, b=75025, c=75025, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=75025, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [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=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [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=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [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=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [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=75025, b=46368, c=46368, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=46368, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, counter++=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, counter++=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [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=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [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=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [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=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, counter++=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [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=46368, b=28657, c=28657, counter=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=28657, counter=15, counter++=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, counter++=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, counter++=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [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=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [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=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [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=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, counter++=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [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=28657, b=17711, c=17711, counter=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=17711, counter=19, counter++=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, counter++=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, counter++=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [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=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [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=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [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=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, counter++=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [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=17711, b=10946, c=10946, counter=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=10946, counter=23, counter++=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, counter++=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, counter++=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [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=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [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=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [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=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, counter++=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [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=10946, b=6765, c=6765, counter=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=6765, counter=27, counter++=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, counter++=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, counter++=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [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=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [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=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [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=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, counter++=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [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=6765, b=4181, c=4181, counter=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=4181, counter=31, counter++=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, counter++=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, counter++=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [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=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [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=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [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=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, counter++=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [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=4181, b=2584, c=2584, counter=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=35, counter++=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, counter++=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, counter++=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [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=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [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=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [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=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, counter++=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [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=2584, b=1597, c=1597, counter=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=39, counter++=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, counter++=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, counter++=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [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=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [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=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [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=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, counter++=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [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=1597, b=987, c=987, counter=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=43, counter++=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, counter++=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, counter++=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [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=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [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=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [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=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=1597, b=987, c=610, counter=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, counter++=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [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=987, b=610, c=610, counter=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=47, counter++=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, counter++=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, counter++=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] COND TRUE counter++<100 [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=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [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=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [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=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [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=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=987, b=610, c=377, counter=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, counter++=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [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=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=51, counter++=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=52, counter++=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, counter++=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=610, b=377, c=233, counter=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, counter++=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [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=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=55, counter++=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=56, counter++=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, counter++=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=377, b=233, c=144, counter=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, counter++=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [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=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=59, counter++=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=60, counter++=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, counter++=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=233, b=144, c=89, counter=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, counter++=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [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=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=63, counter++=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=64, counter++=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, counter++=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=144, b=89, c=55, counter=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, counter++=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [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=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=67, counter++=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=68, counter++=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, counter++=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=89, b=55, c=34, counter=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, counter++=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [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=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=71, counter++=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=72, counter++=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, counter++=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=55, b=34, c=21, counter=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, counter++=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [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=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=75, counter++=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=76, counter++=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, counter++=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=34, b=21, c=13, counter=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, counter++=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [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=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=79, counter++=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=80, counter++=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, counter++=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=21, b=13, c=8, counter=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, counter++=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [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=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=83, counter++=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=84, counter++=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, counter++=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=13, b=8, c=5, counter=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, counter++=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [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=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=87, counter++=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=88, counter++=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, counter++=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=8, b=5, c=3, counter=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, counter++=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [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=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=91, counter++=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=92, counter++=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, counter++=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, counter++=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [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=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=95, counter++=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] COND TRUE counter++<100 [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=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=96, counter++=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [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=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, counter++=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, counter++=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [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=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=99, counter++=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=1, c=2, counter=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, counter++=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=101, counter++=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] COND FALSE !(counter++<100) [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2, b=1, c=1, counter=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=102, counter++=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] COND FALSE !(counter++<100) [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=1, b=1, c=1, counter=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=103, counter++=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] COND FALSE !(counter++<100) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=103] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 440.2s, OverallIterations: 37, TraceHistogramMax: 97, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 235.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 31688 SdHoareTripleChecker+Valid, 63.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31611 mSDsluCounter, 28003 SdHoareTripleChecker+Invalid, 58.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23427 mSDsCounter, 23703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25408 IncrementalHoareTripleChecker+Invalid, 49115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23703 mSolverCounterUnsat, 4576 mSDtfsCounter, 25408 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11208 GetRequests, 9346 SyntacticMatches, 16 SemanticMatches, 1846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42164 ImplicationChecksByTransitivity, 92.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39818occurred in iteration=32, InterpolantAutomatonStates: 1796, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 83.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 12368 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 52.0s SatisfiabilityAnalysisTime, 43.7s InterpolantComputationTime, 6425 NumberOfCodeBlocks, 6003 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 10266 ConstructedInterpolants, 0 QuantifiedInterpolants, 33500 SizeOfPredicates, 569 NumberOfNonLiveVariables, 14827 ConjunctsInSsa, 1492 ConjunctsInUnsatCore, 60 InterpolantComputations, 13 PerfectInterpolantSequences, 65048/150318 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-02-23 22:52:32,488 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...