/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 00:32:26,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 00:32:26,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 00:32:26,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 00:32:26,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 00:32:26,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 00:32:26,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 00:32:26,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 00:32:26,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 00:32:26,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 00:32:26,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 00:32:26,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 00:32:26,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 00:32:26,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 00:32:26,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 00:32:26,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 00:32:26,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 00:32:26,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 00:32:26,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 00:32:26,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 00:32:26,344 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 00:32:26,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 00:32:26,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 00:32:26,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 00:32:26,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 00:32:26,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 00:32:26,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 00:32:26,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 00:32:26,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 00:32:26,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 00:32:26,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 00:32:26,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 00:32:26,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 00:32:26,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 00:32:26,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 00:32:26,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 00:32:26,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 00:32:26,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 00:32:26,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 00:32:26,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 00:32:26,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 00:32:26,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 00:32:26,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-20 00:32:26,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 00:32:26,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 00:32:26,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 00:32:26,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 00:32:26,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 00:32:26,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 00:32:26,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 00:32:26,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 00:32:26,382 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 00:32:26,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 00:32:26,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 00:32:26,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 00:32:26,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 00:32:26,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 00:32:26,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 00:32:26,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 00:32:26,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 00:32:26,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 00:32:26,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 00:32:26,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 00:32:26,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 00:32:26,609 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 00:32:26,610 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-03-20 00:32:26,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0be2242/3efab98a55b74f9d84861fd1e593523e/FLAG27e36b151 [2022-03-20 00:32:27,067 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 00:32:27,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-03-20 00:32:27,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0be2242/3efab98a55b74f9d84861fd1e593523e/FLAG27e36b151 [2022-03-20 00:32:27,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0be2242/3efab98a55b74f9d84861fd1e593523e [2022-03-20 00:32:27,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 00:32:27,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 00:32:27,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 00:32:27,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 00:32:27,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 00:32:27,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a30b168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27, skipping insertion in model container [2022-03-20 00:32:27,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 00:32:27,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 00:32:27,625 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-03-20 00:32:27,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 00:32:27,656 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 00:32:27,665 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-03-20 00:32:27,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 00:32:27,693 INFO L208 MainTranslator]: Completed translation [2022-03-20 00:32:27,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27 WrapperNode [2022-03-20 00:32:27,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 00:32:27,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 00:32:27,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 00:32:27,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 00:32:27,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 00:32:27,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 00:32:27,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 00:32:27,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 00:32:27,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (1/1) ... [2022-03-20 00:32:27,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 00:32:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:27,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 00:32:27,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 00:32:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 00:32:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 00:32:27,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 00:32:27,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 00:32:27,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 00:32:27,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 00:32:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 00:32:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 00:32:27,859 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 00:32:27,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 00:32:28,040 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 00:32:28,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 00:32:28,044 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 00:32:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:32:28 BoogieIcfgContainer [2022-03-20 00:32:28,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 00:32:28,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 00:32:28,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 00:32:28,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 00:32:28,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 12:32:27" (1/3) ... [2022-03-20 00:32:28,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e27df43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:32:28, skipping insertion in model container [2022-03-20 00:32:28,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 12:32:27" (2/3) ... [2022-03-20 00:32:28,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e27df43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 12:32:28, skipping insertion in model container [2022-03-20 00:32:28,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 12:32:28" (3/3) ... [2022-03-20 00:32:28,066 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.c [2022-03-20 00:32:28,070 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 00:32:28,070 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 00:32:28,109 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 00:32:28,115 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 00:32:28,115 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 00:32:28,134 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-03-20 00:32:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-20 00:32:28,137 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:28,137 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-03-20 00:32:28,138 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:28,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-03-20 00:32:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:28,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297383483] [2022-03-20 00:32:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 00:32:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 00:32:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 00:32:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 00:32:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-03-20 00:32:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:32:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:28,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297383483] [2022-03-20 00:32:28,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297383483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:32:28,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:32:28,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 00:32:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269711062] [2022-03-20 00:32:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:28,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 00:32:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 00:32:28,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 00:32:28,369 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 00:32:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:28,444 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-03-20 00:32:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 00:32:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-03-20 00:32:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:28,450 INFO L225 Difference]: With dead ends: 72 [2022-03-20 00:32:28,450 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 00:32:28,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 00:32:28,455 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:28,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:32:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 00:32:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-03-20 00:32:28,485 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-03-20 00:32:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-03-20 00:32:28,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-03-20 00:32:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:28,489 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-03-20 00:32:28,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 00:32:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-03-20 00:32:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 00:32:28,491 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:28,491 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-03-20 00:32:28,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 00:32:28,491 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-03-20 00:32:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36611049] [2022-03-20 00:32:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:28,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:28,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436417157] [2022-03-20 00:32:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:28,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:28,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 00:32:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:28,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 00:32:28,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:32:28,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:32:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36611049] [2022-03-20 00:32:28,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436417157] [2022-03-20 00:32:28,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436417157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:32:28,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:32:28,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 00:32:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153763486] [2022-03-20 00:32:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:28,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 00:32:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 00:32:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 00:32:28,703 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-03-20 00:32:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:28,715 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-03-20 00:32:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 00:32:28,715 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-03-20 00:32:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:28,716 INFO L225 Difference]: With dead ends: 44 [2022-03-20 00:32:28,716 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 00:32:28,717 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-03-20 00:32:28,717 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-03-20 00:32:28,718 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-03-20 00:32:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 00:32:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-20 00:32:28,723 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-03-20 00:32:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-03-20 00:32:28,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-03-20 00:32:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:28,725 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-03-20 00:32:28,725 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-03-20 00:32:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-03-20 00:32:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 00:32:28,726 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:28,726 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-03-20 00:32:28,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:28,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:28,936 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-03-20 00:32:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:28,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496139872] [2022-03-20 00:32:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:28,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:28,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652505239] [2022-03-20 00:32:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:28,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:28,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:28,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:28,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 00:32:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:29,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 00:32:29,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:32:29,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:32:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:29,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496139872] [2022-03-20 00:32:29,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:29,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652505239] [2022-03-20 00:32:29,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652505239] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:29,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:29,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-03-20 00:32:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29210820] [2022-03-20 00:32:29,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:29,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 00:32:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 00:32:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 00:32:29,199 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-03-20 00:32:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:29,250 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-03-20 00:32:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 00:32:29,250 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-03-20 00:32:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:29,253 INFO L225 Difference]: With dead ends: 53 [2022-03-20 00:32:29,253 INFO L226 Difference]: Without dead ends: 45 [2022-03-20 00:32:29,254 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-03-20 00:32:29,256 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:29,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-20 00:32:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-03-20 00:32:29,274 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-03-20 00:32:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-03-20 00:32:29,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-03-20 00:32:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:29,275 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-03-20 00:32:29,275 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-03-20 00:32:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-03-20 00:32:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-20 00:32:29,276 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:29,276 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-03-20 00:32:29,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:29,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-20 00:32:29,509 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-03-20 00:32:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430583766] [2022-03-20 00:32:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:29,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:29,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931347359] [2022-03-20 00:32:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:29,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:29,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:29,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 00:32:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:29,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:32:29,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:32:29,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:32:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:29,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430583766] [2022-03-20 00:32:29,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:29,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931347359] [2022-03-20 00:32:29,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931347359] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:29,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:29,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-03-20 00:32:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408192589] [2022-03-20 00:32:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:29,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:32:29,731 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-03-20 00:32:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:29,758 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-03-20 00:32:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:32:29,759 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-03-20 00:32:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:29,760 INFO L225 Difference]: With dead ends: 43 [2022-03-20 00:32:29,760 INFO L226 Difference]: Without dead ends: 41 [2022-03-20 00:32:29,760 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-03-20 00:32:29,774 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:29,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-20 00:32:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-20 00:32:29,779 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-03-20 00:32:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-03-20 00:32:29,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-03-20 00:32:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:29,781 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-03-20 00:32:29,781 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-03-20 00:32:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-03-20 00:32:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 00:32:29,782 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:29,782 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-03-20 00:32:29,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:30,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,001 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-03-20 00:32:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222971258] [2022-03-20 00:32:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:30,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:30,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113916309] [2022-03-20 00:32:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:30,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:30,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 00:32:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:30,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 00:32:30,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:32:30,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:32:30,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222971258] [2022-03-20 00:32:30,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113916309] [2022-03-20 00:32:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113916309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:32:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:32:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 00:32:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690267725] [2022-03-20 00:32:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:30,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 00:32:30,135 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-03-20 00:32:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:30,156 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-03-20 00:32:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:32:30,156 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-03-20 00:32:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:30,157 INFO L225 Difference]: With dead ends: 66 [2022-03-20 00:32:30,157 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 00:32:30,157 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-03-20 00:32:30,158 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-03-20 00:32:30,158 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-03-20 00:32:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 00:32:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-03-20 00:32:30,162 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-03-20 00:32:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-03-20 00:32:30,163 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-03-20 00:32:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:30,163 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-03-20 00:32:30,163 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-03-20 00:32:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-03-20 00:32:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 00:32:30,164 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:30,164 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-03-20 00:32:30,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 00:32:30,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,380 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-03-20 00:32:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:30,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305039773] [2022-03-20 00:32:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:30,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:30,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713296486] [2022-03-20 00:32:30,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:30,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 00:32:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:30,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:32:30,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-20 00:32:30,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-20 00:32:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305039773] [2022-03-20 00:32:30,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713296486] [2022-03-20 00:32:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713296486] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:30,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:30,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-20 00:32:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921498437] [2022-03-20 00:32:30,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:30,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:32:30,676 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-03-20 00:32:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:30,702 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-03-20 00:32:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:32:30,703 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-03-20 00:32:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:30,707 INFO L225 Difference]: With dead ends: 57 [2022-03-20 00:32:30,707 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 00:32:30,708 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-03-20 00:32:30,708 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:30,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 00:32:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-03-20 00:32:30,717 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-03-20 00:32:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-03-20 00:32:30,717 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-03-20 00:32:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:30,717 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-03-20 00:32:30,718 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-03-20 00:32:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-03-20 00:32:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 00:32:30,718 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:30,718 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-03-20 00:32:30,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:30,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,949 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-03-20 00:32:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:30,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748388747] [2022-03-20 00:32:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:30,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181154421] [2022-03-20 00:32:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:30,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:30,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 00:32:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:31,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 00:32:31,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 00:32:31,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 00:32:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:31,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748388747] [2022-03-20 00:32:31,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:31,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181154421] [2022-03-20 00:32:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181154421] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:31,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:31,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-20 00:32:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064532075] [2022-03-20 00:32:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:31,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:31,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:32:31,272 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-03-20 00:32:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:31,303 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-03-20 00:32:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 00:32:31,304 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-03-20 00:32:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:31,304 INFO L225 Difference]: With dead ends: 61 [2022-03-20 00:32:31,304 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 00:32:31,305 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-03-20 00:32:31,305 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:31,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 00:32:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-03-20 00:32:31,311 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-03-20 00:32:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-03-20 00:32:31,312 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-03-20 00:32:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:31,312 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-03-20 00:32:31,312 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-03-20 00:32:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-03-20 00:32:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 00:32:31,313 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:31,313 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-03-20 00:32:31,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:31,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:31,530 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-03-20 00:32:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:31,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523011616] [2022-03-20 00:32:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:31,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:31,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870107253] [2022-03-20 00:32:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:31,539 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:31,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 00:32:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:31,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-20 00:32:31,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-20 00:32:31,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523011616] [2022-03-20 00:32:31,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870107253] [2022-03-20 00:32:31,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870107253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:31,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:31,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-03-20 00:32:31,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001997610] [2022-03-20 00:32:31,971 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:31,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:32:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:32:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-20 00:32:31,973 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-03-20 00:32:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:32,116 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-03-20 00:32:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 00:32:32,116 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-03-20 00:32:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:32,119 INFO L225 Difference]: With dead ends: 65 [2022-03-20 00:32:32,119 INFO L226 Difference]: Without dead ends: 63 [2022-03-20 00:32:32,120 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-03-20 00:32:32,120 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:32,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:32:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-20 00:32:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-03-20 00:32:32,133 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-03-20 00:32:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-03-20 00:32:32,135 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-03-20 00:32:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:32,135 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-03-20 00:32:32,136 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-03-20 00:32:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-03-20 00:32:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-20 00:32:32,140 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:32,140 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-03-20 00:32:32,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:32,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:32,357 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-03-20 00:32:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446521999] [2022-03-20 00:32:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:32,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:32,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591071299] [2022-03-20 00:32:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:32,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:32,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 00:32:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:32,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:32:32,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:32:32,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:32:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446521999] [2022-03-20 00:32:32,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591071299] [2022-03-20 00:32:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591071299] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:32,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-20 00:32:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661019633] [2022-03-20 00:32:32,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:32,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:32:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:32:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:32:32,627 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-03-20 00:32:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:32,764 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-03-20 00:32:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:32:32,764 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-03-20 00:32:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:32,766 INFO L225 Difference]: With dead ends: 215 [2022-03-20 00:32:32,766 INFO L226 Difference]: Without dead ends: 207 [2022-03-20 00:32:32,767 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-03-20 00:32:32,767 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 84 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:32,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:32:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-03-20 00:32:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-03-20 00:32:32,784 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-03-20 00:32:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-03-20 00:32:32,785 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-03-20 00:32:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:32,785 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-03-20 00:32:32,785 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-03-20 00:32:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-03-20 00:32:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 00:32:32,786 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:32,786 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-03-20 00:32:32,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:33,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-20 00:32:33,020 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-03-20 00:32:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:33,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942426148] [2022-03-20 00:32:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:33,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:33,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582090433] [2022-03-20 00:32:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:33,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:33,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:33,039 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:33,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 00:32:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:33,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:32:33,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 00:32:33,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-20 00:32:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942426148] [2022-03-20 00:32:33,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:33,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582090433] [2022-03-20 00:32:33,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582090433] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:33,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:33,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-20 00:32:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560206616] [2022-03-20 00:32:33,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:33,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 00:32:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 00:32:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 00:32:33,330 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-03-20 00:32:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:33,480 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-03-20 00:32:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 00:32:33,480 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-03-20 00:32:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:33,481 INFO L225 Difference]: With dead ends: 283 [2022-03-20 00:32:33,481 INFO L226 Difference]: Without dead ends: 263 [2022-03-20 00:32:33,482 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-03-20 00:32:33,482 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:33,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 451 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:32:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-03-20 00:32:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-03-20 00:32:33,500 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-03-20 00:32:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-03-20 00:32:33,502 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-03-20 00:32:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:33,502 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-03-20 00:32:33,502 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-03-20 00:32:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-03-20 00:32:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 00:32:33,503 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:33,503 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-03-20 00:32:33,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:33,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-20 00:32:33,722 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-03-20 00:32:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:33,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442222684] [2022-03-20 00:32:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:33,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:33,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629458296] [2022-03-20 00:32:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:33,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:33,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:33,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 00:32:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:33,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 00:32:33,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:32:33,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-20 00:32:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:33,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442222684] [2022-03-20 00:32:33,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:33,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629458296] [2022-03-20 00:32:33,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629458296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:33,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:33,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-20 00:32:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080551264] [2022-03-20 00:32:33,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:33,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 00:32:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 00:32:33,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 00:32:33,999 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-03-20 00:32:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:34,121 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-03-20 00:32:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:32:34,122 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-03-20 00:32:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:34,123 INFO L225 Difference]: With dead ends: 348 [2022-03-20 00:32:34,123 INFO L226 Difference]: Without dead ends: 252 [2022-03-20 00:32:34,124 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-03-20 00:32:34,124 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 100 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:34,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 207 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 00:32:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-03-20 00:32:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-03-20 00:32:34,137 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-03-20 00:32:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-03-20 00:32:34,138 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-03-20 00:32:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:34,138 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-03-20 00:32:34,138 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-03-20 00:32:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-03-20 00:32:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 00:32:34,138 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:34,139 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-03-20 00:32:34,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:34,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-20 00:32:34,355 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-03-20 00:32:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545667572] [2022-03-20 00:32:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:34,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:34,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386683152] [2022-03-20 00:32:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:34,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:34,383 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:34,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 00:32:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:34,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-20 00:32:34,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 00:32:34,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 00:32:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545667572] [2022-03-20 00:32:34,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386683152] [2022-03-20 00:32:34,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386683152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:34,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:34,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-03-20 00:32:34,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875225118] [2022-03-20 00:32:34,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:34,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 00:32:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 00:32:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-20 00:32:34,830 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-03-20 00:32:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:35,171 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-03-20 00:32:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 00:32:35,171 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-03-20 00:32:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:35,173 INFO L225 Difference]: With dead ends: 334 [2022-03-20 00:32:35,174 INFO L226 Difference]: Without dead ends: 328 [2022-03-20 00:32:35,174 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-03-20 00:32:35,174 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:35,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 357 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 00:32:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-20 00:32:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-03-20 00:32:35,196 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-03-20 00:32:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-03-20 00:32:35,198 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-03-20 00:32:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:35,198 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-03-20 00:32:35,199 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-03-20 00:32:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-03-20 00:32:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-20 00:32:35,199 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:35,200 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-03-20 00:32:35,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:35,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-20 00:32:35,415 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-03-20 00:32:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:35,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163502748] [2022-03-20 00:32:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:35,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255210863] [2022-03-20 00:32:35,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:32:35,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:35,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:35,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:35,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 00:32:35,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:32:35,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:35,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-20 00:32:35,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-20 00:32:35,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-20 00:32:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163502748] [2022-03-20 00:32:36,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255210863] [2022-03-20 00:32:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255210863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:36,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:36,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-03-20 00:32:36,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525629320] [2022-03-20 00:32:36,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:36,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 00:32:36,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:36,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 00:32:36,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-20 00:32:36,058 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-03-20 00:32:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:37,599 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-03-20 00:32:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 00:32:37,611 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-03-20 00:32:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:37,614 INFO L225 Difference]: With dead ends: 319 [2022-03-20 00:32:37,614 INFO L226 Difference]: Without dead ends: 316 [2022-03-20 00:32:37,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-03-20 00:32:37,616 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:37,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 401 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 00:32:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-03-20 00:32:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-03-20 00:32:37,666 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-03-20 00:32:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-03-20 00:32:37,667 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-03-20 00:32:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:37,667 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-03-20 00:32:37,667 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-03-20 00:32:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-03-20 00:32:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 00:32:37,668 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:37,668 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-03-20 00:32:37,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:37,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 00:32:37,888 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-03-20 00:32:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:37,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805336799] [2022-03-20 00:32:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:37,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:37,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792416621] [2022-03-20 00:32:37,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:32:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:37,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:37,914 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:37,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 00:32:37,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 00:32:37,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:37,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-20 00:32:37,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-03-20 00:32:38,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:38,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805336799] [2022-03-20 00:32:38,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:38,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792416621] [2022-03-20 00:32:38,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792416621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:38,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 00:32:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671348804] [2022-03-20 00:32:38,523 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:38,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 00:32:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 00:32:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-20 00:32:38,524 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-03-20 00:32:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:39,021 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-03-20 00:32:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 00:32:39,022 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-03-20 00:32:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:39,026 INFO L225 Difference]: With dead ends: 337 [2022-03-20 00:32:39,026 INFO L226 Difference]: Without dead ends: 333 [2022-03-20 00:32:39,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-20 00:32:39,027 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:39,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 281 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 00:32:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-03-20 00:32:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-03-20 00:32:39,099 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-03-20 00:32:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-03-20 00:32:39,105 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-03-20 00:32:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:39,106 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-03-20 00:32:39,107 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-03-20 00:32:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-03-20 00:32:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-03-20 00:32:39,108 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:39,108 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-03-20 00:32:39,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:39,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 00:32:39,328 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-03-20 00:32:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995722864] [2022-03-20 00:32:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:39,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380842811] [2022-03-20 00:32:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:39,352 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:39,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 00:32:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:39,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-20 00:32:39,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-20 00:32:39,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-20 00:32:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995722864] [2022-03-20 00:32:40,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380842811] [2022-03-20 00:32:40,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380842811] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:40,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:40,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-03-20 00:32:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30464982] [2022-03-20 00:32:40,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:40,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 00:32:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 00:32:40,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-03-20 00:32:40,382 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-03-20 00:32:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:42,731 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-03-20 00:32:42,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-20 00:32:42,731 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-03-20 00:32:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:42,733 INFO L225 Difference]: With dead ends: 392 [2022-03-20 00:32:42,733 INFO L226 Difference]: Without dead ends: 377 [2022-03-20 00:32:42,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-03-20 00:32:42,735 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:42,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 495 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-20 00:32:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-03-20 00:32:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-03-20 00:32:42,768 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-03-20 00:32:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-03-20 00:32:42,770 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-03-20 00:32:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:42,770 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-03-20 00:32:42,770 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-03-20 00:32:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-03-20 00:32:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-20 00:32:42,771 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:42,771 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-03-20 00:32:42,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:42,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:42,985 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:42,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-03-20 00:32:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:42,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997306671] [2022-03-20 00:32:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:42,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:42,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531397501] [2022-03-20 00:32:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:42,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:42,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:43,020 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:43,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-20 00:32:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:43,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-20 00:32:43,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-03-20 00:32:43,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:44,043 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:44,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997306671] [2022-03-20 00:32:44,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:44,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531397501] [2022-03-20 00:32:44,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531397501] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 00:32:44,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 00:32:44,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-03-20 00:32:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102325856] [2022-03-20 00:32:44,445 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:44,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 00:32:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:44,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 00:32:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-20 00:32:44,446 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-03-20 00:32:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:45,136 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-03-20 00:32:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 00:32:45,147 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-03-20 00:32:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:45,149 INFO L225 Difference]: With dead ends: 377 [2022-03-20 00:32:45,149 INFO L226 Difference]: Without dead ends: 375 [2022-03-20 00:32:45,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 00:32:45,150 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:45,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 438 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 00:32:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-03-20 00:32:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-03-20 00:32:45,183 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-03-20 00:32:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-03-20 00:32:45,184 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-03-20 00:32:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:45,185 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-03-20 00:32:45,185 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-03-20 00:32:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-03-20 00:32:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-20 00:32:45,186 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:45,186 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-03-20 00:32:45,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-20 00:32:45,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 00:32:45,403 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2076615365, now seen corresponding path program 4 times [2022-03-20 00:32:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:45,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553110814] [2022-03-20 00:32:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:45,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:45,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704257947] [2022-03-20 00:32:45,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 00:32:45,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:45,448 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:45,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-20 00:32:45,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 00:32:45,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:45,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 00:32:45,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-03-20 00:32:45,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 00:32:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:45,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553110814] [2022-03-20 00:32:45,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:45,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704257947] [2022-03-20 00:32:45,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704257947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 00:32:45,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 00:32:45,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 00:32:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278733819] [2022-03-20 00:32:45,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 00:32:45,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 00:32:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 00:32:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 00:32:45,599 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-03-20 00:32:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:45,667 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-03-20 00:32:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 00:32:45,668 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-03-20 00:32:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:45,670 INFO L225 Difference]: With dead ends: 535 [2022-03-20 00:32:45,670 INFO L226 Difference]: Without dead ends: 417 [2022-03-20 00:32:45,670 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-03-20 00:32:45,671 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:45,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 00:32:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-03-20 00:32:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-03-20 00:32:45,705 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-03-20 00:32:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-03-20 00:32:45,707 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-03-20 00:32:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:45,707 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-03-20 00:32:45,707 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-03-20 00:32:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-03-20 00:32:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-20 00:32:45,708 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:45,708 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-03-20 00:32:45,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-20 00:32:45,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-20 00:32:45,925 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 1 times [2022-03-20 00:32:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:45,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774503847] [2022-03-20 00:32:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:45,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:45,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72312343] [2022-03-20 00:32:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:45,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:45,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:45,936 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:45,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-20 00:32:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:32:46,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-20 00:32:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-20 00:32:46,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-03-20 00:32:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:32:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774503847] [2022-03-20 00:32:46,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:32:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72312343] [2022-03-20 00:32:46,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72312343] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:32:46,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:32:46,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-20 00:32:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191617896] [2022-03-20 00:32:46,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:32:46,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 00:32:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:32:46,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 00:32:46,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-20 00:32:46,430 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-03-20 00:32:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:32:46,896 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-03-20 00:32:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 00:32:46,896 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-03-20 00:32:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:32:46,901 INFO L225 Difference]: With dead ends: 1393 [2022-03-20 00:32:46,901 INFO L226 Difference]: Without dead ends: 1260 [2022-03-20 00:32:46,902 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-03-20 00:32:46,902 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 318 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:32:46,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 456 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 00:32:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-03-20 00:32:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-03-20 00:32:47,015 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-03-20 00:32:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-03-20 00:32:47,019 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-03-20 00:32:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:32:47,020 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-03-20 00:32:47,020 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-03-20 00:32:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-03-20 00:32:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-20 00:32:47,021 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:32:47,021 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-03-20 00:32:47,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-20 00:32:47,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 00:32:47,243 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:32:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:32:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 2 times [2022-03-20 00:32:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:32:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103116538] [2022-03-20 00:32:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:32:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:32:47,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:32:47,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060392310] [2022-03-20 00:32:47,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:32:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:32:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:32:47,258 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 00:32:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 00:32:47,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:32:47,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:32:47,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-20 00:32:47,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:32:50,712 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:32:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-03-20 00:32:52,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:32:55,585 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:33:14,218 WARN L232 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:33:14,666 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 00:33:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 136 proven. 86 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-03-20 00:33:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:33:22,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103116538] [2022-03-20 00:33:22,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:33:22,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060392310] [2022-03-20 00:33:22,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060392310] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:33:22,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:33:22,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-03-20 00:33:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231784849] [2022-03-20 00:33:22,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:33:22,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-20 00:33:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:33:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-20 00:33:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=638, Unknown=4, NotChecked=0, Total=812 [2022-03-20 00:33:22,408 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-20 00:33:24,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:26,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:29,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:32,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:34,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:37,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:45,033 WARN L232 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 146 DAG size of output: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:33:53,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:55,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:33:58,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:00,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:03,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:05,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:07,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:09,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:11,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:34,911 WARN L232 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:34:41,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:48,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:50,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:34:59,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:01,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:03,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:19,391 WARN L232 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:35:24,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:27,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-03-20 00:35:29,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:35,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:37,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:39,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:35:48,494 WARN L232 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 147 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:35:53,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:01,929 WARN L232 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 147 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:36:16,768 WARN L232 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 110 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:36:18,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:20,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:22,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:34,330 WARN L232 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 146 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:36:36,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:41,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:43,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:45,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:49,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:51,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:53,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:55,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:57,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:36:59,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:01,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:03,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:05,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:07,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:09,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:11,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:13,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:15,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:17,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:19,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:37:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:37:19,458 INFO L93 Difference]: Finished difference Result 1626 states and 2111 transitions. [2022-03-20 00:37:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-20 00:37:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) Word has length 124 [2022-03-20 00:37:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:37:19,467 INFO L225 Difference]: With dead ends: 1626 [2022-03-20 00:37:19,467 INFO L226 Difference]: Without dead ends: 1624 [2022-03-20 00:37:19,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=610, Invalid=2033, Unknown=9, NotChecked=0, Total=2652 [2022-03-20 00:37:19,469 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 226 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 319 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 129.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.3s IncrementalHoareTripleChecker+Time [2022-03-20 00:37:19,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 765 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1073 Invalid, 46 Unknown, 0 Unchecked, 129.3s Time] [2022-03-20 00:37:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-03-20 00:37:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1545. [2022-03-20 00:37:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 972 states have (on average 1.1779835390946503) internal successors, (1145), 988 states have internal predecessors, (1145), 430 states have call successors, (430), 143 states have call predecessors, (430), 142 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-03-20 00:37:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1996 transitions. [2022-03-20 00:37:19,805 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1996 transitions. Word has length 124 [2022-03-20 00:37:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:37:19,805 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1996 transitions. [2022-03-20 00:37:19,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-20 00:37:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1996 transitions. [2022-03-20 00:37:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-20 00:37:19,807 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:37:19,807 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-03-20 00:37:19,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-20 00:37:20,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:37:20,018 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:37:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:37:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 3 times [2022-03-20 00:37:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:37:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029287969] [2022-03-20 00:37:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:37:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:37:20,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:37:20,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786473948] [2022-03-20 00:37:20,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:37:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:37:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:37:20,042 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-03-20 00:37:20,064 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-03-20 00:37:20,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 00:37:20,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:37:20,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-20 00:37:20,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:37:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-20 00:37:21,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:38:09,232 WARN L232 SmtUtils]: Spent 16.92s 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-03-20 00:38:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 56 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-20 00:38:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:38:18,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029287969] [2022-03-20 00:38:18,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:38:18,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786473948] [2022-03-20 00:38:18,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786473948] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:38:18,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:38:18,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-03-20 00:38:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409650041] [2022-03-20 00:38:18,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:38:18,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 00:38:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:38:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 00:38:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=356, Unknown=1, NotChecked=0, Total=462 [2022-03-20 00:38:18,064 INFO L87 Difference]: Start difference. First operand 1545 states and 1996 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-03-20 00:38:43,524 WARN L232 SmtUtils]: Spent 24.08s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:38:50,159 WARN L232 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:38:58,642 WARN L232 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 00:39:00,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:02,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:06,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-03-20 00:39:08,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:10,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:15,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:17,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:20,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:23,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:25,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:27,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:29,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:31,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:34,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:36,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:40,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:42,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 00:39:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:39:42,927 INFO L93 Difference]: Finished difference Result 1870 states and 2446 transitions. [2022-03-20 00:39:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 00:39:42,928 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-03-20 00:39:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:39:42,934 INFO L225 Difference]: With dead ends: 1870 [2022-03-20 00:39:42,934 INFO L226 Difference]: Without dead ends: 1854 [2022-03-20 00:39:42,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=352, Invalid=978, Unknown=2, NotChecked=0, Total=1332 [2022-03-20 00:39:42,935 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 154 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 171 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:39:42,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 744 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 854 Invalid, 16 Unknown, 0 Unchecked, 39.1s Time] [2022-03-20 00:39:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-03-20 00:39:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1756. [2022-03-20 00:39:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1118 states have (on average 1.1914132379248659) internal successors, (1332), 1130 states have internal predecessors, (1332), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-20 00:39:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2293 transitions. [2022-03-20 00:39:43,423 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2293 transitions. Word has length 128 [2022-03-20 00:39:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:39:43,424 INFO L478 AbstractCegarLoop]: Abstraction has 1756 states and 2293 transitions. [2022-03-20 00:39:43,424 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-03-20 00:39:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2293 transitions. [2022-03-20 00:39:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-20 00:39:43,425 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:39:43,425 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-03-20 00:39:43,442 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-03-20 00:39:43,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:39:43,631 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:39:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:39:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 1 times [2022-03-20 00:39:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:39:43,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341246687] [2022-03-20 00:39:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:39:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:39:43,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:39:43,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333829247] [2022-03-20 00:39:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:39:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:39:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:39:43,648 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-03-20 00:39:43,648 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-03-20 00:39:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:39:43,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-20 00:39:43,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:39:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-03-20 00:39:43,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:39:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-03-20 00:39:44,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:39:44,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341246687] [2022-03-20 00:39:44,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:39:44,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333829247] [2022-03-20 00:39:44,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333829247] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:39:44,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:39:44,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-20 00:39:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894822679] [2022-03-20 00:39:44,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:39:44,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 00:39:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:39:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 00:39:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-20 00:39:44,137 INFO L87 Difference]: Start difference. First operand 1756 states and 2293 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-03-20 00:39:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:39:44,874 INFO L93 Difference]: Finished difference Result 1819 states and 2355 transitions. [2022-03-20 00:39:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 00:39:44,874 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-03-20 00:39:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:39:44,880 INFO L225 Difference]: With dead ends: 1819 [2022-03-20 00:39:44,880 INFO L226 Difference]: Without dead ends: 1809 [2022-03-20 00:39:44,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-03-20 00:39:44,881 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 327 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 00:39:44,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 421 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 00:39:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-03-20 00:39:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1777. [2022-03-20 00:39:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1139 states have (on average 1.160667251975417) internal successors, (1322), 1151 states have internal predecessors, (1322), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-20 00:39:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2283 transitions. [2022-03-20 00:39:45,393 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2283 transitions. Word has length 133 [2022-03-20 00:39:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:39:45,394 INFO L478 AbstractCegarLoop]: Abstraction has 1777 states and 2283 transitions. [2022-03-20 00:39:45,394 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-03-20 00:39:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2283 transitions. [2022-03-20 00:39:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-20 00:39:45,395 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:39:45,395 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-03-20 00:39:45,415 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-03-20 00:39:45,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-20 00:39:45,611 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:39:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:39:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 2 times [2022-03-20 00:39:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:39:45,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108799141] [2022-03-20 00:39:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:39:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:39:45,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:39:45,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109898141] [2022-03-20 00:39:45,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:39:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:39:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:39:45,620 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-03-20 00:39:45,631 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-03-20 00:39:45,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:39:45,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:39:45,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-20 00:39:45,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:39:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-03-20 00:39:47,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:39:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-03-20 00:39:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:39:48,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108799141] [2022-03-20 00:39:48,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:39:48,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109898141] [2022-03-20 00:39:48,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109898141] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:39:48,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:39:48,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-03-20 00:39:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547721047] [2022-03-20 00:39:48,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:39:48,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 00:39:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:39:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 00:39:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-03-20 00:39:48,552 INFO L87 Difference]: Start difference. First operand 1777 states and 2283 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-03-20 00:39:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:39:53,714 INFO L93 Difference]: Finished difference Result 1899 states and 2421 transitions. [2022-03-20 00:39:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-20 00:39:53,715 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-03-20 00:39:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:39:53,720 INFO L225 Difference]: With dead ends: 1899 [2022-03-20 00:39:53,720 INFO L226 Difference]: Without dead ends: 1888 [2022-03-20 00:39:53,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-03-20 00:39:53,721 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 135 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:39:53,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 597 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-20 00:39:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-03-20 00:39:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1729. [2022-03-20 00:39:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1098 states have (on average 1.138433515482696) internal successors, (1250), 1113 states have internal predecessors, (1250), 461 states have call successors, (461), 170 states have call predecessors, (461), 169 states have return successors, (459), 445 states have call predecessors, (459), 459 states have call successors, (459) [2022-03-20 00:39:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2170 transitions. [2022-03-20 00:39:54,161 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2170 transitions. Word has length 134 [2022-03-20 00:39:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:39:54,161 INFO L478 AbstractCegarLoop]: Abstraction has 1729 states and 2170 transitions. [2022-03-20 00:39:54,161 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-03-20 00:39:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2170 transitions. [2022-03-20 00:39:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-03-20 00:39:54,166 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:39:54,166 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-03-20 00:39:54,197 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-03-20 00:39:54,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-20 00:39:54,383 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:39:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:39:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2083543191, now seen corresponding path program 2 times [2022-03-20 00:39:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:39:54,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181848597] [2022-03-20 00:39:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:39:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:39:54,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:39:54,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107224841] [2022-03-20 00:39:54,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:39:54,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:39:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:39:54,392 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-03-20 00:39:54,397 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-03-20 00:39:54,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:39:54,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:39:54,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 00:39:54,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:39:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-20 00:39:54,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:39:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-20 00:39:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:39:55,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181848597] [2022-03-20 00:39:55,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:39:55,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107224841] [2022-03-20 00:39:55,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107224841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:39:55,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:39:55,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-20 00:39:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746387882] [2022-03-20 00:39:55,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:39:55,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-20 00:39:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:39:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-20 00:39:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-20 00:39:55,565 INFO L87 Difference]: Start difference. First operand 1729 states and 2170 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-03-20 00:39:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:39:58,655 INFO L93 Difference]: Finished difference Result 6934 states and 9753 transitions. [2022-03-20 00:39:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-20 00:39:58,656 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-03-20 00:39:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:39:58,683 INFO L225 Difference]: With dead ends: 6934 [2022-03-20 00:39:58,684 INFO L226 Difference]: Without dead ends: 6925 [2022-03-20 00:39:58,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1384, Invalid=2398, Unknown=0, NotChecked=0, Total=3782 [2022-03-20 00:39:58,689 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 884 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 00:39:58,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 792 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 00:39:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2022-03-20 00:40:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 6797. [2022-03-20 00:40:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6797 states, 4391 states have (on average 1.223183785014803) internal successors, (5371), 4532 states have internal predecessors, (5371), 1967 states have call successors, (1967), 440 states have call predecessors, (1967), 438 states have return successors, (1951), 1824 states have call predecessors, (1951), 1951 states have call successors, (1951) [2022-03-20 00:40:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6797 states to 6797 states and 9289 transitions. [2022-03-20 00:40:00,812 INFO L78 Accepts]: Start accepts. Automaton has 6797 states and 9289 transitions. Word has length 260 [2022-03-20 00:40:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:40:00,813 INFO L478 AbstractCegarLoop]: Abstraction has 6797 states and 9289 transitions. [2022-03-20 00:40:00,813 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-03-20 00:40:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6797 states and 9289 transitions. [2022-03-20 00:40:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-03-20 00:40:00,817 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:40:00,818 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-03-20 00:40:00,837 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-03-20 00:40:01,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:40:01,038 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:40:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:40:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 996673892, now seen corresponding path program 1 times [2022-03-20 00:40:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:40:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274124329] [2022-03-20 00:40:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:40:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:40:01,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:40:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624079231] [2022-03-20 00:40:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:40:01,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:40:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:40:01,052 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-03-20 00:40:01,054 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-03-20 00:40:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 00:40:01,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 00:40:01,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:40:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-20 00:40:01,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:40:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-20 00:40:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:40:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274124329] [2022-03-20 00:40:02,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:40:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624079231] [2022-03-20 00:40:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624079231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:40:02,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:40:02,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-20 00:40:02,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752114600] [2022-03-20 00:40:02,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:40:02,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-20 00:40:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:40:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-20 00:40:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-20 00:40:02,056 INFO L87 Difference]: Start difference. First operand 6797 states and 9289 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-03-20 00:40:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:40:04,296 INFO L93 Difference]: Finished difference Result 7838 states and 10739 transitions. [2022-03-20 00:40:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-20 00:40:04,297 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-03-20 00:40:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:40:04,310 INFO L225 Difference]: With dead ends: 7838 [2022-03-20 00:40:04,310 INFO L226 Difference]: Without dead ends: 4561 [2022-03-20 00:40:04,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2022-03-20 00:40:04,321 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 719 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 00:40:04,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [719 Valid, 620 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 00:40:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2022-03-20 00:40:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4273. [2022-03-20 00:40:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 2618 states have (on average 1.1130634071810543) internal successors, (2914), 2649 states have internal predecessors, (2914), 1229 states have call successors, (1229), 426 states have call predecessors, (1229), 425 states have return successors, (1227), 1197 states have call predecessors, (1227), 1227 states have call successors, (1227) [2022-03-20 00:40:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5370 transitions. [2022-03-20 00:40:05,441 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5370 transitions. Word has length 263 [2022-03-20 00:40:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:40:05,441 INFO L478 AbstractCegarLoop]: Abstraction has 4273 states and 5370 transitions. [2022-03-20 00:40:05,441 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-03-20 00:40:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5370 transitions. [2022-03-20 00:40:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2022-03-20 00:40:05,451 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:40:05,451 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-03-20 00:40:05,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-20 00:40:05,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:40:05,665 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:40:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:40:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash 797964696, now seen corresponding path program 2 times [2022-03-20 00:40:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:40:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032478682] [2022-03-20 00:40:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:40:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:40:05,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:40:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706057271] [2022-03-20 00:40:05,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 00:40:05,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:40:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:40:05,677 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-03-20 00:40:05,681 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-03-20 00:40:05,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 00:40:05,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:40:05,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-20 00:40:05,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:40:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 12389 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-03-20 00:40:06,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:40:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 1445 refuted. 0 times theorem prover too weak. 11424 trivial. 0 not checked. [2022-03-20 00:40:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:40:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032478682] [2022-03-20 00:40:08,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:40:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706057271] [2022-03-20 00:40:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706057271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:40:08,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:40:08,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-03-20 00:40:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239644909] [2022-03-20 00:40:08,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:40:08,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-20 00:40:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:40:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-20 00:40:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-03-20 00:40:08,197 INFO L87 Difference]: Start difference. First operand 4273 states and 5370 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-03-20 00:40:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:40:12,333 INFO L93 Difference]: Finished difference Result 8203 states and 10663 transitions. [2022-03-20 00:40:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-20 00:40:12,343 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-03-20 00:40:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:40:12,372 INFO L225 Difference]: With dead ends: 8203 [2022-03-20 00:40:12,372 INFO L226 Difference]: Without dead ends: 7902 [2022-03-20 00:40:12,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 978 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3809, Invalid=6493, Unknown=0, NotChecked=0, Total=10302 [2022-03-20 00:40:12,379 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1156 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 1129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1129 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 00:40:12,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 1033 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1129 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 00:40:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2022-03-20 00:40:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7438. [2022-03-20 00:40:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 4502 states have (on average 1.1183918258551755) internal successors, (5035), 4553 states have internal predecessors, (5035), 2190 states have call successors, (2190), 747 states have call predecessors, (2190), 745 states have return successors, (2187), 2137 states have call predecessors, (2187), 2187 states have call successors, (2187) [2022-03-20 00:40:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9412 transitions. [2022-03-20 00:40:14,390 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9412 transitions. Word has length 516 [2022-03-20 00:40:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:40:14,391 INFO L478 AbstractCegarLoop]: Abstraction has 7438 states and 9412 transitions. [2022-03-20 00:40:14,391 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-03-20 00:40:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9412 transitions. [2022-03-20 00:40:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-03-20 00:40:14,400 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:40:14,401 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-03-20 00:40:14,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-20 00:40:14,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-20 00:40:14,615 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:40:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:40:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2048195451, now seen corresponding path program 3 times [2022-03-20 00:40:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:40:14,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905930153] [2022-03-20 00:40:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:40:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:40:14,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:40:14,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786320068] [2022-03-20 00:40:14,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 00:40:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:40:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:40:14,632 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-03-20 00:40:14,632 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-03-20 00:42:59,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-03-20 00:42:59,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 00:42:59,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-20 00:42:59,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 00:43:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 13690 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-03-20 00:43:00,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 00:43:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 1530 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2022-03-20 00:43:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 00:43:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905930153] [2022-03-20 00:43:01,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 00:43:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786320068] [2022-03-20 00:43:01,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786320068] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 00:43:01,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 00:43:01,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-03-20 00:43:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112128623] [2022-03-20 00:43:01,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 00:43:01,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-20 00:43:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 00:43:01,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-20 00:43:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-03-20 00:43:01,940 INFO L87 Difference]: Start difference. First operand 7438 states and 9412 transitions. Second operand has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 40 states have call successors, (172), 24 states have call predecessors, (172), 23 states have return successors, (170), 38 states have call predecessors, (170), 39 states have call successors, (170) [2022-03-20 00:43:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 00:43:05,937 INFO L93 Difference]: Finished difference Result 7463 states and 9442 transitions. [2022-03-20 00:43:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-20 00:43:05,938 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 40 states have call successors, (172), 24 states have call predecessors, (172), 23 states have return successors, (170), 38 states have call predecessors, (170), 39 states have call successors, (170) Word has length 533 [2022-03-20 00:43:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 00:43:05,954 INFO L225 Difference]: With dead ends: 7463 [2022-03-20 00:43:05,954 INFO L226 Difference]: Without dead ends: 7453 [2022-03-20 00:43:05,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1012 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3810, Invalid=6492, Unknown=0, NotChecked=0, Total=10302 [2022-03-20 00:43:05,958 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1140 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 1195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1195 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 00:43:05,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 935 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1195 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 00:43:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2022-03-20 00:43:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7453. [2022-03-20 00:43:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7453 states, 4518 states have (on average 1.1053563523683045) internal successors, (4994), 4569 states have internal predecessors, (4994), 2189 states have call successors, (2189), 746 states have call predecessors, (2189), 745 states have return successors, (2187), 2137 states have call predecessors, (2187), 2187 states have call successors, (2187) [2022-03-20 00:43:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7453 states to 7453 states and 9370 transitions. [2022-03-20 00:43:07,938 INFO L78 Accepts]: Start accepts. Automaton has 7453 states and 9370 transitions. Word has length 533 [2022-03-20 00:43:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 00:43:07,939 INFO L478 AbstractCegarLoop]: Abstraction has 7453 states and 9370 transitions. [2022-03-20 00:43:07,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 40 states have call successors, (172), 24 states have call predecessors, (172), 23 states have return successors, (170), 38 states have call predecessors, (170), 39 states have call successors, (170) [2022-03-20 00:43:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7453 states and 9370 transitions. [2022-03-20 00:43:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2022-03-20 00:43:07,956 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 00:43:07,956 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-03-20 00:43:07,981 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-03-20 00:43:08,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-20 00:43:08,171 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 00:43:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 00:43:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1781675311, now seen corresponding path program 4 times [2022-03-20 00:43:08,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 00:43:08,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312142022] [2022-03-20 00:43:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 00:43:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 00:43:08,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 00:43:08,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45907763] [2022-03-20 00:43:08,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 00:43:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 00:43:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 00:43:08,190 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-03-20 00:43:08,191 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-03-20 00:43:26,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 00:43:26,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-20 00:43:26,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 00:43:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 00:43:33,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 00:43:33,523 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 00:43:33,525 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 00:43:33,545 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-03-20 00:43:33,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-20 00:43:33,744 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 00:43:33,746 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 00:43:33,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 12:43:33 BoogieIcfgContainer [2022-03-20 00:43:33,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 00:43:33,900 INFO L158 Benchmark]: Toolchain (without parser) took 666435.29ms. Allocated memory was 202.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 144.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 918.6MB. Max. memory is 8.0GB. [2022-03-20 00:43:33,901 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 00:43:33,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 202.4MB. Free memory was 144.3MB in the beginning and 171.1MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 00:43:33,904 INFO L158 Benchmark]: Boogie Preprocessor took 33.22ms. Allocated memory is still 202.4MB. Free memory was 171.1MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 00:43:33,904 INFO L158 Benchmark]: RCFGBuilder took 317.04ms. Allocated memory is still 202.4MB. Free memory was 169.6MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 00:43:33,904 INFO L158 Benchmark]: TraceAbstraction took 665852.37ms. Allocated memory was 202.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 157.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 931.7MB. Max. memory is 8.0GB. [2022-03-20 00:43:33,904 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 202.4MB. Free memory was 144.3MB in the beginning and 171.1MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.22ms. Allocated memory is still 202.4MB. Free memory was 171.1MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 317.04ms. Allocated memory is still 202.4MB. Free memory was 169.6MB in the beginning and 158.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 665852.37ms. Allocated memory was 202.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 157.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 931.7MB. 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 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 665.6s, OverallIterations: 27, TraceHistogramMax: 133, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 348.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 62 mSolverCounterUnknown, 5752 SdHoareTripleChecker+Valid, 178.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5668 mSDsluCounter, 10577 SdHoareTripleChecker+Invalid, 177.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8631 mSDsCounter, 5489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9231 IncrementalHoareTripleChecker+Invalid, 14782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5489 mSolverCounterUnsat, 1946 mSDtfsCounter, 9231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6285 GetRequests, 5568 SyntacticMatches, 21 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5949 ImplicationChecksByTransitivity, 211.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7453occurred in iteration=26, InterpolantAutomatonStates: 626, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 1443 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 183.7s SatisfiabilityAnalysisTime, 109.6s InterpolantComputationTime, 4072 NumberOfCodeBlocks, 3982 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 5940 ConstructedInterpolants, 0 QuantifiedInterpolants, 29663 SizeOfPredicates, 214 NumberOfNonLiveVariables, 8313 ConjunctsInSsa, 772 ConjunctsInUnsatCore, 45 InterpolantComputations, 7 PerfectInterpolantSequences, 37510/73764 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-20 00:43:33,957 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...