/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 06:43:55,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 06:43:55,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 06:43:55,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 06:43:55,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 06:43:55,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 06:43:55,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 06:43:55,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 06:43:55,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 06:43:55,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 06:43:55,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 06:43:55,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 06:43:55,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 06:43:55,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 06:43:55,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 06:43:55,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 06:43:55,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 06:43:55,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 06:43:55,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 06:43:55,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 06:43:55,430 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 06:43:55,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 06:43:55,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 06:43:55,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 06:43:55,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 06:43:55,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 06:43:55,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 06:43:55,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 06:43:55,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 06:43:55,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 06:43:55,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 06:43:55,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 06:43:55,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 06:43:55,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 06:43:55,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 06:43:55,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 06:43:55,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 06:43:55,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 06:43:55,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 06:43:55,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 06:43:55,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 06:43:55,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 06:43:55,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-06 06:43:55,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 06:43:55,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 06:43:55,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 06:43:55,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 06:43:55,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 06:43:55,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 06:43:55,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 06:43:55,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 06:43:55,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 06:43:55,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 06:43:55,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 06:43:55,464 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 06:43:55,464 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 06:43:55,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 06:43:55,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 06:43:55,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 06:43:55,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 06:43:55,685 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 06:43:55,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-06 06:43:55,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efea2124b/6d6b9a0258284ad58e444b5c82df2b5d/FLAG99c05da84 [2022-04-06 06:43:56,101 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 06:43:56,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-06 06:43:56,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efea2124b/6d6b9a0258284ad58e444b5c82df2b5d/FLAG99c05da84 [2022-04-06 06:43:56,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efea2124b/6d6b9a0258284ad58e444b5c82df2b5d [2022-04-06 06:43:56,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 06:43:56,513 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 06:43:56,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 06:43:56,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 06:43:56,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 06:43:56,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fccf3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56, skipping insertion in model container [2022-04-06 06:43:56,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 06:43:56,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 06:43:56,692 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/egcd2-ll_unwindbound50.c[490,503] [2022-04-06 06:43:56,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 06:43:56,728 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 06:43:56,736 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/egcd2-ll_unwindbound50.c[490,503] [2022-04-06 06:43:56,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 06:43:56,768 INFO L208 MainTranslator]: Completed translation [2022-04-06 06:43:56,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56 WrapperNode [2022-04-06 06:43:56,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 06:43:56,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 06:43:56,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 06:43:56,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 06:43:56,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 06:43:56,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 06:43:56,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 06:43:56,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 06:43:56,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (1/1) ... [2022-04-06 06:43:56,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 06:43:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:56,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 06:43:56,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 06:43:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 06:43:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 06:43:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 06:43:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 06:43:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 06:43:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 06:43:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 06:43:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 06:43:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 06:43:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 06:43:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 06:43:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 06:43:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 06:43:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 06:43:56,922 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 06:43:56,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 06:43:57,044 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 06:43:57,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 06:43:57,048 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-06 06:43:57,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:43:57 BoogieIcfgContainer [2022-04-06 06:43:57,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 06:43:57,050 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 06:43:57,050 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 06:43:57,051 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 06:43:57,053 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:43:57" (1/1) ... [2022-04-06 06:43:57,054 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-06 06:43:57,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 06:43:57 BasicIcfg [2022-04-06 06:43:57,066 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 06:43:57,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 06:43:57,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 06:43:57,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 06:43:57,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 06:43:56" (1/4) ... [2022-04-06 06:43:57,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2242dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:43:57, skipping insertion in model container [2022-04-06 06:43:57,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:43:56" (2/4) ... [2022-04-06 06:43:57,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2242dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:43:57, skipping insertion in model container [2022-04-06 06:43:57,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:43:57" (3/4) ... [2022-04-06 06:43:57,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2242dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:43:57, skipping insertion in model container [2022-04-06 06:43:57,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 06:43:57" (4/4) ... [2022-04-06 06:43:57,071 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.cJordan [2022-04-06 06:43:57,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-06 06:43:57,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 06:43:57,124 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 06:43:57,133 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 06:43:57,134 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 06:43:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-06 06:43:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-06 06:43:57,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:57,152 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:43:57,152 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-06 06:43:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:57,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250117703] [2022-04-06 06:43:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:57,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:57,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695622742] [2022-04-06 06:43:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:57,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:57,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 06:43:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:57,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-06 06:43:57,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-06 06:43:57,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:43:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:43:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250117703] [2022-04-06 06:43:57,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:43:57,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695622742] [2022-04-06 06:43:57,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695622742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:43:57,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:43:57,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 06:43:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121790381] [2022-04-06 06:43:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:43:57,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-06 06:43:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:43:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-06 06:43:57,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 06:43:57,442 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:43:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:43:57,455 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-06 06:43:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-06 06:43:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-06 06:43:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:43:57,462 INFO L225 Difference]: With dead ends: 39 [2022-04-06 06:43:57,462 INFO L226 Difference]: Without dead ends: 34 [2022-04-06 06:43:57,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 06:43:57,467 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:43:57,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:43:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-06 06:43:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-06 06:43:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 06:43:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-06 06:43:57,498 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-06 06:43:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:43:57,500 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-06 06:43:57,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:43:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-06 06:43:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-06 06:43:57,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:57,502 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:43:57,521 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-04-06 06:43:57,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-06 06:43:57,710 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-06 06:43:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64054882] [2022-04-06 06:43:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:57,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:57,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122391842] [2022-04-06 06:43:57,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:57,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:57,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:57,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:57,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 06:43:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:57,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 06:43:57,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-06 06:43:57,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:43:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:43:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64054882] [2022-04-06 06:43:57,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:43:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122391842] [2022-04-06 06:43:57,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122391842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:43:57,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:43:57,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 06:43:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771569917] [2022-04-06 06:43:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:43:57,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 06:43:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:43:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 06:43:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 06:43:57,954 INFO L87 Difference]: Start difference. First operand 34 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:43:57,978 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-06 06:43:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 06:43:57,979 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-06 06:43:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:43:57,980 INFO L225 Difference]: With dead ends: 36 [2022-04-06 06:43:57,980 INFO L226 Difference]: Without dead ends: 36 [2022-04-06 06:43:57,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 06:43:57,981 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:43:57,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:43:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-06 06:43:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-06 06:43:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 06:43:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-06 06:43:57,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-06 06:43:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:43:57,986 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-06 06:43:57,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-06 06:43:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 06:43:57,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:57,987 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:43:58,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 06:43:58,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-06 06:43:58,201 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-06 06:43:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:58,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757966479] [2022-04-06 06:43:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:58,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:58,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602090472] [2022-04-06 06:43:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:58,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:58,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:58,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 06:43:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:58,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 06:43:58,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-06 06:43:58,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:43:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-06 06:43:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:43:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757966479] [2022-04-06 06:43:58,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:43:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602090472] [2022-04-06 06:43:58,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602090472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:43:58,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:43:58,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-06 06:43:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38257502] [2022-04-06 06:43:58,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:43:58,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 06:43:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:43:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 06:43:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 06:43:58,453 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:43:58,577 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-06 06:43:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 06:43:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-06 06:43:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:43:58,579 INFO L225 Difference]: With dead ends: 45 [2022-04-06 06:43:58,579 INFO L226 Difference]: Without dead ends: 45 [2022-04-06 06:43:58,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-06 06:43:58,581 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:43:58,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:43:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-06 06:43:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-06 06:43:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 06:43:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-06 06:43:58,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-06 06:43:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:43:58,595 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-06 06:43:58,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-06 06:43:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-06 06:43:58,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:58,596 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:43:58,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 06:43:58,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:58,812 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-06 06:43:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:58,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836267742] [2022-04-06 06:43:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:58,827 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:58,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689516717] [2022-04-06 06:43:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:58,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:58,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:58,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 06:43:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:58,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 06:43:58,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-06 06:43:59,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:43:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-06 06:43:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:43:59,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836267742] [2022-04-06 06:43:59,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:43:59,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689516717] [2022-04-06 06:43:59,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689516717] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-06 06:43:59,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:43:59,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-06 06:43:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643798927] [2022-04-06 06:43:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:43:59,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:43:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:43:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:43:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:43:59,115 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:43:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:43:59,151 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-06 06:43:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 06:43:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-06 06:43:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:43:59,153 INFO L225 Difference]: With dead ends: 41 [2022-04-06 06:43:59,153 INFO L226 Difference]: Without dead ends: 41 [2022-04-06 06:43:59,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-06 06:43:59,153 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:43:59,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:43:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-06 06:43:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-06 06:43:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 06:43:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-06 06:43:59,158 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-06 06:43:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:43:59,159 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-06 06:43:59,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:43:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-06 06:43:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-06 06:43:59,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:59,160 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:43:59,176 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-04-06 06:43:59,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:59,371 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-06 06:43:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:59,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762562246] [2022-04-06 06:43:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:59,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:59,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195394191] [2022-04-06 06:43:59,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:59,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:59,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 06:43:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:59,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 06:43:59,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-06 06:43:59,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:43:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:43:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762562246] [2022-04-06 06:43:59,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:43:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195394191] [2022-04-06 06:43:59,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195394191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:43:59,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:43:59,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 06:43:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170822400] [2022-04-06 06:43:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:43:59,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:43:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:43:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:43:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 06:43:59,505 INFO L87 Difference]: Start difference. First operand 41 states and 51 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:43:59,529 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-06 06:43:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 06:43:59,530 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-06 06:43:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:43:59,532 INFO L225 Difference]: With dead ends: 43 [2022-04-06 06:43:59,532 INFO L226 Difference]: Without dead ends: 43 [2022-04-06 06:43:59,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-06 06:43:59,534 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:43:59,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:43:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-06 06:43:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-06 06:43:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-06 06:43:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-06 06:43:59,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-06 06:43:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:43:59,543 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-06 06:43:59,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-06 06:43:59,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-06 06:43:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-06 06:43:59,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:43:59,543 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-06 06:43:59,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 06:43:59,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:59,748 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:43:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:43:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-04-06 06:43:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:43:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948585299] [2022-04-06 06:43:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:43:59,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:43:59,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808747389] [2022-04-06 06:43:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:43:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:43:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:43:59,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:43:59,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 06:43:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:43:59,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 06:43:59,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:43:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-06 06:43:59,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-06 06:44:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948585299] [2022-04-06 06:44:00,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808747389] [2022-04-06 06:44:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808747389] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:00,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:00,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-06 06:44:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312864743] [2022-04-06 06:44:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:44:00,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:44:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:44:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 06:44:00,063 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-06 06:44:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:00,102 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-06 06:44:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 06:44:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-06 06:44:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:00,103 INFO L225 Difference]: With dead ends: 55 [2022-04-06 06:44:00,103 INFO L226 Difference]: Without dead ends: 55 [2022-04-06 06:44:00,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:44:00,106 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:00,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:44:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-06 06:44:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-06 06:44:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-06 06:44:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-06 06:44:00,123 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-06 06:44:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:00,124 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-06 06:44:00,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-06 06:44:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-06 06:44:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-06 06:44:00,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:00,125 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-04-06 06:44:00,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:00,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:00,336 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-04-06 06:44:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:00,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422943914] [2022-04-06 06:44:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:00,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:00,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:00,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620508908] [2022-04-06 06:44:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:00,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:00,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-06 06:44:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 06:44:00,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-06 06:44:00,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 06:44:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422943914] [2022-04-06 06:44:00,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620508908] [2022-04-06 06:44:00,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620508908] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:00,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:00,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-06 06:44:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237386533] [2022-04-06 06:44:00,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:44:00,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:44:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:44:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 06:44:00,704 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-06 06:44:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:00,738 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-06 06:44:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 06:44:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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 46 [2022-04-06 06:44:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:00,739 INFO L225 Difference]: With dead ends: 59 [2022-04-06 06:44:00,739 INFO L226 Difference]: Without dead ends: 59 [2022-04-06 06:44:00,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:44:00,740 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:00,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:44:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-06 06:44:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-06 06:44:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-06 06:44:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-06 06:44:00,743 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-06 06:44:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:00,748 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-06 06:44:00,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-06 06:44:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-06 06:44:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-06 06:44:00,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:00,749 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:00,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:00,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:00,965 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-04-06 06:44:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:00,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145667582] [2022-04-06 06:44:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:00,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:00,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597485536] [2022-04-06 06:44:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:00,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:00,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:00,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:00,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-06 06:44:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:01,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-06 06:44:01,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-06 06:44:01,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:01,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145667582] [2022-04-06 06:44:01,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:01,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597485536] [2022-04-06 06:44:01,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597485536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:01,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:01,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-06 06:44:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871845174] [2022-04-06 06:44:01,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:01,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 06:44:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 06:44:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-06 06:44:01,321 INFO L87 Difference]: Start difference. First operand 58 states and 72 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-06 06:44:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:01,444 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-06 06:44:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 06:44:01,444 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-06 06:44:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:01,445 INFO L225 Difference]: With dead ends: 63 [2022-04-06 06:44:01,445 INFO L226 Difference]: Without dead ends: 63 [2022-04-06 06:44:01,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-06 06:44:01,446 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:01,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:44:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-06 06:44:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-06 06:44:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-06 06:44:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-06 06:44:01,449 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-06 06:44:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:01,450 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-06 06:44:01,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-06 06:44:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-06 06:44:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-06 06:44:01,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:01,450 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1] [2022-04-06 06:44:01,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:01,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-06 06:44:01,656 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-04-06 06:44:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593997682] [2022-04-06 06:44:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:01,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:01,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575523607] [2022-04-06 06:44:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:01,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:01,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:01,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-06 06:44:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:01,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 06:44:01,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-06 06:44:01,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-06 06:44:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593997682] [2022-04-06 06:44:01,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575523607] [2022-04-06 06:44:01,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575523607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:01,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:01,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-06 06:44:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059659977] [2022-04-06 06:44:01,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:01,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 06:44:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 06:44:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:44:01,921 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 06:44:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:02,041 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-06 06:44:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 06:44:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-06 06:44:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:02,045 INFO L225 Difference]: With dead ends: 207 [2022-04-06 06:44:02,045 INFO L226 Difference]: Without dead ends: 207 [2022-04-06 06:44:02,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-06 06:44:02,047 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 119 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:02,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 264 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:44:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-06 06:44:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-04-06 06:44:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-06 06:44:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-04-06 06:44:02,071 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-04-06 06:44:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:02,072 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-04-06 06:44:02,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 06:44:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-04-06 06:44:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-06 06:44:02,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:02,074 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1] [2022-04-06 06:44:02,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:02,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:02,282 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:02,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1491020248, now seen corresponding path program 1 times [2022-04-06 06:44:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:02,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818588900] [2022-04-06 06:44:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:02,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:02,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221961959] [2022-04-06 06:44:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:02,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:02,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:02,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:02,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-06 06:44:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:02,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 06:44:02,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-06 06:44:02,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-06 06:44:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818588900] [2022-04-06 06:44:02,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221961959] [2022-04-06 06:44:02,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221961959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:02,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:02,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-06 06:44:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340917164] [2022-04-06 06:44:02,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:02,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 06:44:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 06:44:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 06:44:02,532 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-06 06:44:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:02,707 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-06 06:44:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 06:44:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-06 06:44:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:02,709 INFO L225 Difference]: With dead ends: 263 [2022-04-06 06:44:02,709 INFO L226 Difference]: Without dead ends: 263 [2022-04-06 06:44:02,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-06 06:44:02,710 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:02,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 314 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:44:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-06 06:44:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-04-06 06:44:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-06 06:44:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-04-06 06:44:02,718 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-04-06 06:44:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:02,719 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-04-06 06:44:02,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-06 06:44:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-04-06 06:44:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-06 06:44:02,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:02,720 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:02,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:02,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-06 06:44:02,935 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 317217743, now seen corresponding path program 1 times [2022-04-06 06:44:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228444357] [2022-04-06 06:44:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:02,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:02,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030670151] [2022-04-06 06:44:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:02,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:02,945 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:02,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-06 06:44:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:02,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 06:44:02,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-06 06:44:03,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-06 06:44:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:03,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228444357] [2022-04-06 06:44:03,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:03,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030670151] [2022-04-06 06:44:03,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030670151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:03,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:03,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-06 06:44:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11967923] [2022-04-06 06:44:03,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:03,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 06:44:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 06:44:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:44:03,198 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 06:44:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:03,299 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-06 06:44:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 06:44:03,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-06 06:44:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:03,302 INFO L225 Difference]: With dead ends: 252 [2022-04-06 06:44:03,302 INFO L226 Difference]: Without dead ends: 252 [2022-04-06 06:44:03,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-06 06:44:03,303 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:03,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 266 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:44:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-06 06:44:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-04-06 06:44:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-06 06:44:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-04-06 06:44:03,316 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-04-06 06:44:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:03,317 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-04-06 06:44:03,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-06 06:44:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-04-06 06:44:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-06 06:44:03,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:03,318 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:03,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:03,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-06 06:44:03,537 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash 918639692, now seen corresponding path program 1 times [2022-04-06 06:44:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363399387] [2022-04-06 06:44:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:03,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:03,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609045650] [2022-04-06 06:44:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:03,549 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:03,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-06 06:44:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:03,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-06 06:44:03,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-06 06:44:03,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-06 06:44:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363399387] [2022-04-06 06:44:03,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609045650] [2022-04-06 06:44:03,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609045650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:03,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:03,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-06 06:44:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971740334] [2022-04-06 06:44:03,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:03,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-06 06:44:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:03,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-06 06:44:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-06 06:44:03,975 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-06 06:44:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:04,302 INFO L93 Difference]: Finished difference Result 332 states and 429 transitions. [2022-04-06 06:44:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-06 06:44:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-06 06:44:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:04,304 INFO L225 Difference]: With dead ends: 332 [2022-04-06 06:44:04,304 INFO L226 Difference]: Without dead ends: 328 [2022-04-06 06:44:04,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-06 06:44:04,305 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:04,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 308 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 06:44:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-06 06:44:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-04-06 06:44:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-06 06:44:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-04-06 06:44:04,313 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-04-06 06:44:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:04,313 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-04-06 06:44:04,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-06 06:44:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-04-06 06:44:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-06 06:44:04,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:04,314 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 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, 1] [2022-04-06 06:44:04,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:04,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-06 06:44:04,525 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash -210356579, now seen corresponding path program 2 times [2022-04-06 06:44:04,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:04,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782628102] [2022-04-06 06:44:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:04,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:04,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598001033] [2022-04-06 06:44:04,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:44:04,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:04,534 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:04,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-06 06:44:04,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:44:04,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:44:04,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-06 06:44:04,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-06 06:44:04,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-06 06:44:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782628102] [2022-04-06 06:44:05,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598001033] [2022-04-06 06:44:05,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598001033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:05,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:05,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-06 06:44:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787649425] [2022-04-06 06:44:05,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:05,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-06 06:44:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-06 06:44:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-06 06:44:05,099 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-06 06:44:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:06,265 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2022-04-06 06:44:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 06:44:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-06 06:44:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:06,267 INFO L225 Difference]: With dead ends: 317 [2022-04-06 06:44:06,267 INFO L226 Difference]: Without dead ends: 316 [2022-04-06 06:44:06,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-06 06:44:06,267 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:06,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 271 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-06 06:44:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-06 06:44:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-04-06 06:44:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-06 06:44:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-04-06 06:44:06,275 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-04-06 06:44:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:06,276 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-04-06 06:44:06,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-06 06:44:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-04-06 06:44:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-06 06:44:06,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:06,276 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:06,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:06,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-06 06:44:06,493 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash 952478412, now seen corresponding path program 3 times [2022-04-06 06:44:06,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:06,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098921632] [2022-04-06 06:44:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:06,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:06,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944224942] [2022-04-06 06:44:06,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 06:44:06,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:06,520 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:06,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-06 06:44:06,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-06 06:44:06,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:44:06,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-06 06:44:06,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-06 06:44:06,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:07,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098921632] [2022-04-06 06:44:07,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944224942] [2022-04-06 06:44:07,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944224942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:07,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:07,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-06 06:44:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261057143] [2022-04-06 06:44:07,065 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:07,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 06:44:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 06:44:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-06 06:44:07,067 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-06 06:44:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:07,258 INFO L93 Difference]: Finished difference Result 335 states and 407 transitions. [2022-04-06 06:44:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 06:44:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-06 06:44:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:07,260 INFO L225 Difference]: With dead ends: 335 [2022-04-06 06:44:07,260 INFO L226 Difference]: Without dead ends: 333 [2022-04-06 06:44:07,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-06 06:44:07,260 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:07,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 06:44:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-06 06:44:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-04-06 06:44:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-06 06:44:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-04-06 06:44:07,268 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-04-06 06:44:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:07,268 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-04-06 06:44:07,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-06 06:44:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-04-06 06:44:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-06 06:44:07,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:07,269 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 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, 1, 1] [2022-04-06 06:44:07,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:07,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:07,483 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 900405455, now seen corresponding path program 1 times [2022-04-06 06:44:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:07,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509277379] [2022-04-06 06:44:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:07,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:07,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188263029] [2022-04-06 06:44:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:07,493 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:07,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-06 06:44:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:07,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-06 06:44:07,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-06 06:44:08,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-06 06:44:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:08,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509277379] [2022-04-06 06:44:08,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:08,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188263029] [2022-04-06 06:44:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188263029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:08,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:08,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-06 06:44:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041762894] [2022-04-06 06:44:08,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:08,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-06 06:44:08,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-06 06:44:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-06 06:44:08,472 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-06 06:44:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:11,923 INFO L93 Difference]: Finished difference Result 390 states and 484 transitions. [2022-04-06 06:44:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-06 06:44:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-06 06:44:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:11,925 INFO L225 Difference]: With dead ends: 390 [2022-04-06 06:44:11,925 INFO L226 Difference]: Without dead ends: 377 [2022-04-06 06:44:11,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-06 06:44:11,927 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:11,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 403 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 06:44:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-06 06:44:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-04-06 06:44:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-06 06:44:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-04-06 06:44:11,935 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-04-06 06:44:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:11,936 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-04-06 06:44:11,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-06 06:44:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-04-06 06:44:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-06 06:44:11,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:11,937 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2022-04-06 06:44:11,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:12,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-06 06:44:12,153 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 653404933, now seen corresponding path program 1 times [2022-04-06 06:44:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:12,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520318056] [2022-04-06 06:44:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:12,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085598183] [2022-04-06 06:44:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:12,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:12,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:12,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-06 06:44:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:12,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-06 06:44:12,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-06 06:44:12,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:13,241 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 06:44:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:13,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520318056] [2022-04-06 06:44:13,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:13,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085598183] [2022-04-06 06:44:13,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085598183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:13,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:13,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-06 06:44:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588421264] [2022-04-06 06:44:13,784 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:13,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 06:44:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 06:44:13,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-06 06:44:13,785 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-06 06:44:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:14,727 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-06 06:44:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 06:44:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-06 06:44:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:14,729 INFO L225 Difference]: With dead ends: 375 [2022-04-06 06:44:14,730 INFO L226 Difference]: Without dead ends: 375 [2022-04-06 06:44:14,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-06 06:44:14,730 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:14,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-06 06:44:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-06 06:44:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-04-06 06:44:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-06 06:44:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-04-06 06:44:14,739 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-04-06 06:44:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:14,740 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-04-06 06:44:14,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-06 06:44:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-04-06 06:44:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-06 06:44:14,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:14,742 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 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, 1, 1] [2022-04-06 06:44:14,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:14,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-06 06:44:14,943 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 487608439, now seen corresponding path program 4 times [2022-04-06 06:44:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:14,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315245757] [2022-04-06 06:44:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:14,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:14,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332214168] [2022-04-06 06:44:14,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 06:44:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:14,972 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:14,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-06 06:44:15,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 06:44:15,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:44:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 06:44:15,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-06 06:44:15,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:44:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315245757] [2022-04-06 06:44:15,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332214168] [2022-04-06 06:44:15,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332214168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:44:15,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:44:15,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 06:44:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254237148] [2022-04-06 06:44:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:44:15,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:44:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:44:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 06:44:15,155 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-06 06:44:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:15,209 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-06 06:44:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 06:44:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-06 06:44:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:15,211 INFO L225 Difference]: With dead ends: 417 [2022-04-06 06:44:15,211 INFO L226 Difference]: Without dead ends: 417 [2022-04-06 06:44:15,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-06 06:44:15,212 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:15,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:44:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-06 06:44:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-06 06:44:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-06 06:44:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-04-06 06:44:15,241 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-04-06 06:44:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:15,243 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-04-06 06:44:15,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-06 06:44:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-04-06 06:44:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-06 06:44:15,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:15,244 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:15,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:15,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-06 06:44:15,456 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash 791718745, now seen corresponding path program 1 times [2022-04-06 06:44:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:15,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768481380] [2022-04-06 06:44:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:15,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:15,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551445939] [2022-04-06 06:44:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:15,467 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:15,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-06 06:44:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:44:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-06 06:44:15,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-06 06:44:15,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-06 06:44:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768481380] [2022-04-06 06:44:15,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551445939] [2022-04-06 06:44:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551445939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:44:15,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:44:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-06 06:44:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065396884] [2022-04-06 06:44:15,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:15,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-06 06:44:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-06 06:44:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-06 06:44:15,922 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-06 06:44:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:16,257 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-06 06:44:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 06:44:16,258 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-06 06:44:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:16,262 INFO L225 Difference]: With dead ends: 1260 [2022-04-06 06:44:16,262 INFO L226 Difference]: Without dead ends: 1260 [2022-04-06 06:44:16,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-04-06 06:44:16,263 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 296 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:16,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 458 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 06:44:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-06 06:44:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-04-06 06:44:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-06 06:44:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-04-06 06:44:16,287 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-04-06 06:44:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:16,287 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-04-06 06:44:16,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-06 06:44:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-04-06 06:44:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-06 06:44:16,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:16,289 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:16,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:16,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-06 06:44:16,503 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -351372628, now seen corresponding path program 2 times [2022-04-06 06:44:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:16,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463474900] [2022-04-06 06:44:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:16,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:16,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637644014] [2022-04-06 06:44:16,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:44:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:16,522 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:16,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-06 06:44:16,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:44:16,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:44:16,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-06 06:44:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:19,549 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 06:44:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-06 06:44:21,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:44:31,604 WARN L232 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:44:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:44:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463474900] [2022-04-06 06:44:44,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:44:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637644014] [2022-04-06 06:44:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637644014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 06:44:44,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-06 06:44:44,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-06 06:44:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304781102] [2022-04-06 06:44:44,679 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-06 06:44:44,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-06 06:44:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:44:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-06 06:44:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-04-06 06:44:44,680 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-06 06:44:46,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:44:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:44:50,386 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-06 06:44:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-06 06:44:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-06 06:44:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:44:50,392 INFO L225 Difference]: With dead ends: 1329 [2022-04-06 06:44:50,392 INFO L226 Difference]: Without dead ends: 1329 [2022-04-06 06:44:50,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2022-04-06 06:44:50,393 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-06 06:44:50,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 320 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-06 06:44:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-04-06 06:44:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-04-06 06:44:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-06 06:44:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1632 transitions. [2022-04-06 06:44:50,423 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1632 transitions. Word has length 124 [2022-04-06 06:44:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:44:50,423 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1632 transitions. [2022-04-06 06:44:50,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-06 06:44:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1632 transitions. [2022-04-06 06:44:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-06 06:44:50,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:44:50,424 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:44:50,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-06 06:44:50,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:50,640 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:44:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:44:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1703433466, now seen corresponding path program 3 times [2022-04-06 06:44:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:44:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869087954] [2022-04-06 06:44:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:44:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:44:50,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:44:50,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568268613] [2022-04-06 06:44:50,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 06:44:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:44:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:44:50,672 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:44:50,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-06 06:44:50,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-06 06:44:50,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:44:50,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-06 06:44:50,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:44:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-06 06:44:51,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:45:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 56 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-06 06:45:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:45:21,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869087954] [2022-04-06 06:45:21,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:45:21,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568268613] [2022-04-06 06:45:21,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568268613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:45:21,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:45:21,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-06 06:45:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388952764] [2022-04-06 06:45:21,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:45:21,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-06 06:45:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:45:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-06 06:45:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=352, Unknown=5, NotChecked=0, Total=462 [2022-04-06 06:45:21,385 INFO L87 Difference]: Start difference. First operand 1321 states and 1632 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-06 06:45:23,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:45:26,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:45:57,695 WARN L232 SmtUtils]: Spent 18.97s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:46:40,439 WARN L232 SmtUtils]: Spent 33.94s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:46:42,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:46:44,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:46:46,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:46:49,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:46:59,472 WARN L232 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 78 DAG size of output: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:47:01,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:08,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:12,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:25,985 WARN L232 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:47:28,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:30,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:32,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:34,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:36,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:38,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:40,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:45,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:47,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:56,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:47:58,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:00,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:02,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:04,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:18,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:39,527 WARN L232 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 06:48:41,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:43,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:48:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:48:44,027 INFO L93 Difference]: Finished difference Result 1645 states and 2078 transitions. [2022-04-06 06:48:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-06 06:48:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-06 06:48:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:48:44,032 INFO L225 Difference]: With dead ends: 1645 [2022-04-06 06:48:44,032 INFO L226 Difference]: Without dead ends: 1631 [2022-04-06 06:48:44,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 155.3s TimeCoverageRelationStatistics Valid=374, Invalid=1004, Unknown=28, NotChecked=0, Total=1406 [2022-04-06 06:48:44,033 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 161 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 216 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.5s IncrementalHoareTripleChecker+Time [2022-04-06 06:48:44,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 383 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 811 Invalid, 26 Unknown, 0 Unchecked, 61.5s Time] [2022-04-06 06:48:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-04-06 06:48:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1530. [2022-04-06 06:48:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 989 states have (on average 1.1718907987866531) internal successors, (1159), 996 states have internal predecessors, (1159), 385 states have call successors, (385), 157 states have call predecessors, (385), 155 states have return successors, (382), 376 states have call predecessors, (382), 382 states have call successors, (382) [2022-04-06 06:48:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1926 transitions. [2022-04-06 06:48:44,084 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1926 transitions. Word has length 128 [2022-04-06 06:48:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:48:44,084 INFO L478 AbstractCegarLoop]: Abstraction has 1530 states and 1926 transitions. [2022-04-06 06:48:44,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-06 06:48:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1926 transitions. [2022-04-06 06:48:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-06 06:48:44,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:48:44,085 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-06 06:48:44,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-06 06:48:44,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:44,296 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:48:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:48:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1569660177, now seen corresponding path program 1 times [2022-04-06 06:48:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:48:44,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591950437] [2022-04-06 06:48:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:48:44,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:48:44,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860398364] [2022-04-06 06:48:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:44,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:48:44,306 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:48:44,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-06 06:48:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:48:44,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-06 06:48:44,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:48:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-06 06:48:44,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:48:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-06 06:48:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:48:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591950437] [2022-04-06 06:48:44,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:48:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860398364] [2022-04-06 06:48:44,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860398364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:48:44,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:48:44,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-06 06:48:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062194731] [2022-04-06 06:48:44,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:48:44,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-06 06:48:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:48:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-06 06:48:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-06 06:48:44,832 INFO L87 Difference]: Start difference. First operand 1530 states and 1926 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-06 06:48:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:48:45,188 INFO L93 Difference]: Finished difference Result 1577 states and 1945 transitions. [2022-04-06 06:48:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 06:48:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-04-06 06:48:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:48:45,194 INFO L225 Difference]: With dead ends: 1577 [2022-04-06 06:48:45,194 INFO L226 Difference]: Without dead ends: 1577 [2022-04-06 06:48:45,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-04-06 06:48:45,195 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 335 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 06:48:45,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 335 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 06:48:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-04-06 06:48:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1545. [2022-04-06 06:48:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1004 states have (on average 1.1484063745019921) internal successors, (1153), 1011 states have internal predecessors, (1153), 385 states have call successors, (385), 157 states have call predecessors, (385), 155 states have return successors, (382), 376 states have call predecessors, (382), 382 states have call successors, (382) [2022-04-06 06:48:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1920 transitions. [2022-04-06 06:48:45,252 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1920 transitions. Word has length 133 [2022-04-06 06:48:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:48:45,253 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1920 transitions. [2022-04-06 06:48:45,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-06 06:48:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1920 transitions. [2022-04-06 06:48:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-06 06:48:45,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:48:45,254 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:48:45,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-06 06:48:45,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:45,456 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:48:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:48:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1381701507, now seen corresponding path program 2 times [2022-04-06 06:48:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:48:45,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011206936] [2022-04-06 06:48:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:48:45,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:48:45,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352137809] [2022-04-06 06:48:45,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:48:45,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:48:45,466 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:48:45,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-06 06:48:45,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:48:45,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:48:45,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-06 06:48:45,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:48:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-04-06 06:48:47,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:48:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-06 06:48:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:48:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011206936] [2022-04-06 06:48:48,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:48:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352137809] [2022-04-06 06:48:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352137809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:48:48,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:48:48,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-06 06:48:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902405057] [2022-04-06 06:48:48,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:48:48,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 06:48:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:48:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 06:48:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-04-06 06:48:48,501 INFO L87 Difference]: Start difference. First operand 1545 states and 1920 transitions. Second operand has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-06 06:48:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:48:54,972 INFO L93 Difference]: Finished difference Result 1671 states and 2065 transitions. [2022-04-06 06:48:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-06 06:48:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 134 [2022-04-06 06:48:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:48:54,977 INFO L225 Difference]: With dead ends: 1671 [2022-04-06 06:48:54,977 INFO L226 Difference]: Without dead ends: 1662 [2022-04-06 06:48:54,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-04-06 06:48:54,978 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 93 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-06 06:48:54,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 552 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-06 06:48:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-04-06 06:48:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1351. [2022-04-06 06:48:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 869 states have (on average 1.1357882623705409) internal successors, (987), 879 states have internal predecessors, (987), 328 states have call successors, (328), 154 states have call predecessors, (328), 153 states have return successors, (326), 317 states have call predecessors, (326), 326 states have call successors, (326) [2022-04-06 06:48:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1641 transitions. [2022-04-06 06:48:55,001 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1641 transitions. Word has length 134 [2022-04-06 06:48:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:48:55,002 INFO L478 AbstractCegarLoop]: Abstraction has 1351 states and 1641 transitions. [2022-04-06 06:48:55,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-06 06:48:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1641 transitions. [2022-04-06 06:48:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-04-06 06:48:55,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:48:55,006 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:48:55,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-06 06:48:55,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:55,223 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:48:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:48:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash -42185316, now seen corresponding path program 2 times [2022-04-06 06:48:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:48:55,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249717623] [2022-04-06 06:48:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:48:55,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:48:55,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219660241] [2022-04-06 06:48:55,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:48:55,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:55,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:48:55,235 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:48:55,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-06 06:48:55,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:48:55,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:48:55,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-06 06:48:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:48:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-06 06:48:55,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:48:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-04-06 06:48:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:48:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249717623] [2022-04-06 06:48:56,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:48:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219660241] [2022-04-06 06:48:56,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219660241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:48:56,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:48:56,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-06 06:48:56,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369724353] [2022-04-06 06:48:56,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:48:56,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-06 06:48:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:48:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-06 06:48:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 06:48:56,350 INFO L87 Difference]: Start difference. First operand 1351 states and 1641 transitions. Second operand has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-06 06:48:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:48:57,325 INFO L93 Difference]: Finished difference Result 5468 states and 7251 transitions. [2022-04-06 06:48:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-06 06:48:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 260 [2022-04-06 06:48:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:48:57,344 INFO L225 Difference]: With dead ends: 5468 [2022-04-06 06:48:57,344 INFO L226 Difference]: Without dead ends: 5466 [2022-04-06 06:48:57,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1384, Invalid=2398, Unknown=0, NotChecked=0, Total=3782 [2022-04-06 06:48:57,346 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 928 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 861 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-06 06:48:57,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 672 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [861 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-06 06:48:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2022-04-06 06:48:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5359. [2022-04-06 06:48:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 3519 states have (on average 1.2145495879511226) internal successors, (4274), 3638 states have internal predecessors, (4274), 1449 states have call successors, (1449), 392 states have call predecessors, (1449), 390 states have return successors, (1433), 1328 states have call predecessors, (1433), 1433 states have call successors, (1433) [2022-04-06 06:48:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7156 transitions. [2022-04-06 06:48:57,448 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7156 transitions. Word has length 260 [2022-04-06 06:48:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:48:57,449 INFO L478 AbstractCegarLoop]: Abstraction has 5359 states and 7156 transitions. [2022-04-06 06:48:57,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-06 06:48:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7156 transitions. [2022-04-06 06:48:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-04-06 06:48:57,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:48:57,452 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:48:57,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-06 06:48:57,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:57,667 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:48:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:48:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2118395671, now seen corresponding path program 1 times [2022-04-06 06:48:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:48:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827220122] [2022-04-06 06:48:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:48:57,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:48:57,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869031840] [2022-04-06 06:48:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:48:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:48:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:48:57,686 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:48:57,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-06 06:48:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:48:57,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-06 06:48:57,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:48:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-06 06:48:58,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:48:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-04-06 06:48:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:48:58,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827220122] [2022-04-06 06:48:58,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:48:58,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869031840] [2022-04-06 06:48:58,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869031840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:48:58,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:48:58,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-06 06:48:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179093228] [2022-04-06 06:48:58,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:48:58,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-06 06:48:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:48:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-06 06:48:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 06:48:58,849 INFO L87 Difference]: Start difference. First operand 5359 states and 7156 transitions. Second operand has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-06 06:48:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:48:59,816 INFO L93 Difference]: Finished difference Result 3287 states and 3897 transitions. [2022-04-06 06:48:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-06 06:48:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 263 [2022-04-06 06:48:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:48:59,826 INFO L225 Difference]: With dead ends: 3287 [2022-04-06 06:48:59,826 INFO L226 Difference]: Without dead ends: 3287 [2022-04-06 06:48:59,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2022-04-06 06:48:59,827 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 629 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-06 06:48:59,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 765 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-06 06:48:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2022-04-06 06:48:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3095. [2022-04-06 06:48:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 1941 states have (on average 1.110252447192169) internal successors, (2155), 1951 states have internal predecessors, (2155), 776 states have call successors, (776), 378 states have call predecessors, (776), 377 states have return successors, (774), 765 states have call predecessors, (774), 774 states have call successors, (774) [2022-04-06 06:48:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 3705 transitions. [2022-04-06 06:48:59,890 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 3705 transitions. Word has length 263 [2022-04-06 06:48:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:48:59,890 INFO L478 AbstractCegarLoop]: Abstraction has 3095 states and 3705 transitions. [2022-04-06 06:48:59,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-06 06:48:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3705 transitions. [2022-04-06 06:48:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2022-04-06 06:48:59,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:48:59,900 INFO L499 BasicCegarLoop]: trace histogram [77, 76, 76, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 10, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:48:59,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-06 06:49:00,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:49:00,117 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:49:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:49:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 678663881, now seen corresponding path program 2 times [2022-04-06 06:49:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:49:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436771487] [2022-04-06 06:49:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:49:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:49:00,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:49:00,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114787690] [2022-04-06 06:49:00,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:49:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:49:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:49:00,136 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:49:00,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-06 06:49:00,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:49:00,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:49:00,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-06 06:49:00,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:49:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 12389 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-06 06:49:01,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:49:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 1445 refuted. 0 times theorem prover too weak. 11424 trivial. 0 not checked. [2022-04-06 06:49:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:49:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436771487] [2022-04-06 06:49:02,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:49:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114787690] [2022-04-06 06:49:02,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114787690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:49:02,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:49:02,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-06 06:49:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545984471] [2022-04-06 06:49:02,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:49:02,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 06:49:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:49:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 06:49:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 06:49:02,424 INFO L87 Difference]: Start difference. First operand 3095 states and 3705 transitions. Second operand has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-04-06 06:49:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:49:04,565 INFO L93 Difference]: Finished difference Result 5645 states and 6693 transitions. [2022-04-06 06:49:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-06 06:49:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) Word has length 516 [2022-04-06 06:49:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:49:04,581 INFO L225 Difference]: With dead ends: 5645 [2022-04-06 06:49:04,581 INFO L226 Difference]: Without dead ends: 5607 [2022-04-06 06:49:04,583 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 978 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3809, Invalid=6493, Unknown=0, NotChecked=0, Total=10302 [2022-04-06 06:49:04,584 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1118 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:49:04,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1118 Valid, 1232 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-06 06:49:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5607 states. [2022-04-06 06:49:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5607 to 5269. [2022-04-06 06:49:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3274 states have (on average 1.107819181429444) internal successors, (3627), 3284 states have internal predecessors, (3627), 1337 states have call successors, (1337), 659 states have call predecessors, (1337), 657 states have return successors, (1334), 1325 states have call predecessors, (1334), 1334 states have call successors, (1334) [2022-04-06 06:49:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 6298 transitions. [2022-04-06 06:49:04,655 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 6298 transitions. Word has length 516 [2022-04-06 06:49:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:49:04,655 INFO L478 AbstractCegarLoop]: Abstraction has 5269 states and 6298 transitions. [2022-04-06 06:49:04,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-04-06 06:49:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 6298 transitions. [2022-04-06 06:49:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-04-06 06:49:04,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:49:04,665 INFO L499 BasicCegarLoop]: trace histogram [81, 80, 80, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:49:04,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-06 06:49:04,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-06 06:49:04,878 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:49:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:49:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2865793, now seen corresponding path program 3 times [2022-04-06 06:49:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:49:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450709280] [2022-04-06 06:49:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:49:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:49:04,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:49:04,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656910452] [2022-04-06 06:49:04,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 06:49:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:49:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:49:04,914 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:49:04,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-06 06:54:28,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2022-04-06 06:54:28,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:54:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-06 06:54:28,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:54:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 13690 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-06 06:54:29,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:54:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 1530 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2022-04-06 06:54:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:54:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450709280] [2022-04-06 06:54:30,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:54:30,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656910452] [2022-04-06 06:54:30,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656910452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:54:30,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:54:30,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-06 06:54:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923787528] [2022-04-06 06:54:30,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:54:30,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 06:54:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:54:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 06:54:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 06:54:30,889 INFO L87 Difference]: Start difference. First operand 5269 states and 6298 transitions. Second operand has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-04-06 06:54:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:54:33,171 INFO L93 Difference]: Finished difference Result 5275 states and 6285 transitions. [2022-04-06 06:54:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-06 06:54:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) Word has length 533 [2022-04-06 06:54:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:54:33,189 INFO L225 Difference]: With dead ends: 5275 [2022-04-06 06:54:33,189 INFO L226 Difference]: Without dead ends: 5275 [2022-04-06 06:54:33,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1012 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3810, Invalid=6492, Unknown=0, NotChecked=0, Total=10302 [2022-04-06 06:54:33,192 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1307 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 1399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1399 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-06 06:54:33,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1307 Valid, 1160 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1399 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-06 06:54:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2022-04-06 06:54:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5275. [2022-04-06 06:54:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5275 states, 3281 states have (on average 1.1017982322462663) internal successors, (3615), 3291 states have internal predecessors, (3615), 1336 states have call successors, (1336), 658 states have call predecessors, (1336), 657 states have return successors, (1334), 1325 states have call predecessors, (1334), 1334 states have call successors, (1334) [2022-04-06 06:54:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 6285 transitions. [2022-04-06 06:54:33,323 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 6285 transitions. Word has length 533 [2022-04-06 06:54:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:54:33,323 INFO L478 AbstractCegarLoop]: Abstraction has 5275 states and 6285 transitions. [2022-04-06 06:54:33,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-04-06 06:54:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 6285 transitions. [2022-04-06 06:54:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2022-04-06 06:54:33,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:54:33,338 INFO L499 BasicCegarLoop]: trace histogram [133, 132, 132, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 18, 17, 17, 17, 17, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:54:33,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-06 06:54:33,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-06 06:54:33,547 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:54:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:54:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -652662076, now seen corresponding path program 4 times [2022-04-06 06:54:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:54:33,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157585099] [2022-04-06 06:54:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:54:33,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:54:33,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:54:33,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398542277] [2022-04-06 06:54:33,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 06:54:33,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:54:33,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:54:33,574 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 06:54:33,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-06 06:54:52,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 06:54:52,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-06 06:54:52,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 06:55:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 06:55:00,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 06:55:00,800 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 06:55:00,801 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 06:55:00,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-06 06:55:01,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-06 06:55:01,005 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:55:01,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 06:55:01,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:55:01 BasicIcfg [2022-04-06 06:55:01,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 06:55:01,157 INFO L158 Benchmark]: Toolchain (without parser) took 664642.11ms. Allocated memory was 164.6MB in the beginning and 200.3MB in the end (delta: 35.7MB). Free memory was 114.4MB in the beginning and 45.2MB in the end (delta: 69.2MB). Peak memory consumption was 105.3MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,157 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory was 130.9MB in the beginning and 130.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 06:55:01,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.50ms. Allocated memory is still 164.6MB. Free memory was 114.3MB in the beginning and 140.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,159 INFO L158 Benchmark]: Boogie Preprocessor took 32.82ms. Allocated memory is still 164.6MB. Free memory was 140.4MB in the beginning and 139.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,159 INFO L158 Benchmark]: RCFGBuilder took 246.59ms. Allocated memory is still 164.6MB. Free memory was 138.8MB in the beginning and 127.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,159 INFO L158 Benchmark]: IcfgTransformer took 16.04ms. Allocated memory is still 164.6MB. Free memory was 127.3MB in the beginning and 125.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,164 INFO L158 Benchmark]: TraceAbstraction took 664087.86ms. Allocated memory was 164.6MB in the beginning and 200.3MB in the end (delta: 35.7MB). Free memory was 125.5MB in the beginning and 45.2MB in the end (delta: 80.3MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2022-04-06 06:55:01,166 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 164.6MB. Free memory was 130.9MB in the beginning and 130.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.50ms. Allocated memory is still 164.6MB. Free memory was 114.3MB in the beginning and 140.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.82ms. Allocated memory is still 164.6MB. Free memory was 140.4MB in the beginning and 139.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.59ms. Allocated memory is still 164.6MB. Free memory was 138.8MB in the beginning and 127.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.04ms. Allocated memory is still 164.6MB. Free memory was 127.3MB in the beginning and 125.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 664087.86ms. Allocated memory was 164.6MB in the beginning and 200.3MB in the end (delta: 35.7MB). Free memory was 125.5MB in the beginning and 45.2MB in the end (delta: 80.3MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=53, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [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=2584, y=4181] [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=2584, y=4181] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=1597, b=987, c=987, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=1597, b=987, c=610, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=987, b=610, c=610, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=987, b=610, c=377, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=610, b=377, c=233, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=377, b=233, c=144, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, counter++=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=233, b=144, c=89, counter=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, counter++=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=24, counter++=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, counter++=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=144, b=89, c=55, counter=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, counter++=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=27, counter++=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, counter++=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=89, b=55, c=34, counter=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, counter++=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=30, counter++=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, counter++=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=55, b=34, c=21, counter=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, counter++=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=33, counter++=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, counter++=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=34, b=21, c=13, counter=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, counter++=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=36, counter++=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, counter++=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=21, b=13, c=8, counter=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, counter++=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=39, counter++=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, counter++=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=13, b=8, c=5, counter=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, counter++=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=42, counter++=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, counter++=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=8, b=5, c=3, counter=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, counter++=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=45, counter++=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, counter++=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=5, b=3, c=2, counter=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, counter++=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=48, counter++=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, counter++=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] 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] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) 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(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=3, b=2, c=1, counter=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, counter++=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=51, counter++=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND FALSE !(counter++<50) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 663.9s, OverallIterations: 27, TraceHistogramMax: 133, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 229.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 5613 SdHoareTripleChecker+Valid, 77.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5533 mSDsluCounter, 9327 SdHoareTripleChecker+Invalid, 76.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7382 mSDsCounter, 5360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9124 IncrementalHoareTripleChecker+Invalid, 14510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5360 mSolverCounterUnsat, 1945 mSDtfsCounter, 9124 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6207 GetRequests, 5512 SyntacticMatches, 20 SemanticMatches, 675 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5467 ImplicationChecksByTransitivity, 182.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5359occurred in iteration=23, InterpolantAutomatonStates: 608, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 1283 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 343.8s SatisfiabilityAnalysisTime, 75.1s InterpolantComputationTime, 4072 NumberOfCodeBlocks, 3952 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5817 ConstructedInterpolants, 0 QuantifiedInterpolants, 24166 SizeOfPredicates, 214 NumberOfNonLiveVariables, 8380 ConjunctsInSsa, 773 ConjunctsInUnsatCore, 44 InterpolantComputations, 7 PerfectInterpolantSequences, 37080/73248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-06 06:55:01,202 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...